( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems.

, , , , , и . Numer. Algorithms, 94 (4): 1763-1795 (декабря 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Li Li

Li Li

Li Li

Li Li

Li Li

 

Другие публикации лиц с тем же именем

Strong Duality in Robust Convex Programming: Complete Characterizations., и . SIAM J. Optimization, 20 (6): 3384-3407 (2010)Global Convergence of Splitting Methods for Nonconvex Composite Optimization., и . SIAM J. Optimization, 25 (4): 2434-2460 (2015)Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems., и . SIAM J. Optimization, 20 (2): 667-690 (2009)Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty., и . J. Optimization Theory and Applications, 151 (2): 292-303 (2011)A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty., , и . Oper. Res. Lett., 39 (2): 109-114 (2011)Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints., , , и . Adv. Comput. Math., 49 (1): 8 (февраля 2023)Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems., , и . SIAM J. Optim., 33 (2): 361-393 (2023)A new version of the Liu-Storey conjugate gradient method., , и . Appl. Math. Comput., 189 (1): 302-313 (2007)Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints., , , и . Oper. Res. Lett., 44 (1): 67-73 (2016)Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness., , и . Oper. Res. Lett., 42 (1): 34-40 (2014)