most citedAccelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems

3 citations · 4 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2021

Global Complexity Bound of a Proximal ADMM for Linearly-Constrained Nonseperable Nonconvex Composite Programming

Weiwei Kong, Renato D. C. Monteiro

This paper proposes and analyzes a dampened proximal alternating direction method of multipliers (DP.ADMM) for solving linearly-constrained nonconvex optimization problems where th…

math.OC2021★ 1 cited

FISTA and Extensions -- Review and New Insights

Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro

The purpose of this technical report is to review the main properties of an accelerated composite gradient (ACG) method commonly referred to as the Fast Iterative Shrinkage-Thresho…

math.OC2021★ 3 cited

Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems

Weiwei Kong

This thesis focuses on developing and analyzing accelerated and inexact first-order methods for solving or finding stationary points of various nonconvex composite optimization (NC…

math.OC2020

Iteration-complexity of a proximal augmented Lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints

Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro

This paper proposes and analyzes a proximal augmented Lagrangian (NL-IAPIAL) method for solving smooth nonconvex composite optimization problems with nonlinear -convex cons…

math.OC2020

Accelerated Inexact Composite Gradient Methods for Nonconvex Spectral Optimization Problems

Weiwei Kong, Renato D. C. Monteiro

This paper presents two inexact composite gradient methods, one inner accelerated and another doubly accelerated, for solving a class of nonconvex spectral composite optimization p…