15 citations · 25 across the 6 of their papers we have counts for
6 papers
Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
Weiwei Kong
This paper develops and analyzes an accelerated proximal descent method for finding stationary points of nonconvex composite optimization problems. The objective function is of the…
An Accelerated Inexact Dampened Augmented Lagrangian Method for Linearly-Constrained Nonconvex Composite Optimization Problems
Weiwei Kong, Renato D. C. Monteiro
This paper proposes and analyzes an accelerated inexact dampened augmented Lagrangian (AIDAL) method for solving linearly-constrained nonconvex composite optimization problems. Eac…
Iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function
Jefferson G. Melo, Renato D. C. Monteiro, Weiwei Kong
This paper establishes the iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian (IAIPAL) method for solving linearly-constrained smooth nonconvex comp…
An accelerated inexact proximal point method for solving nonconvex-concave min-max problems
Weiwei Kong, Renato D. C. Monteiro
This paper presents smoothing schemes for obtaining approximate stationary points of unconstrained or linearly-constrained composite nonconvex-concave min-max (and hence nonsmooth)…
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro
This paper proposes an efficient adaptive variant of a quadratic penalty accelerated inexact proximal point (QP-AIPP) method proposed earlier by the authors. Both the QP-AIPP metho…
Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro
This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More sp…