Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization

Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function ⋮ A stochastic primal-dual method for a class of nonconvex constrained optimization ⋮ First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems ⋮ Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization

Unnamed Item
NC-OPT
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Gradient methods for minimizing composite functions
Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
Barrier subgradient method
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
Introductory lectures on convex optimization. A basic course.
Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Global convergence of ADMM in nonconvex nonsmooth optimization
Iteration-complexity of first-order penalty methods for convex programming
Global minimization using an augmented Lagrangian method with variable lower-level constraints
Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
Algorithms for stochastic optimization with function or expectation constraints
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Efficiency of minimizing compositions of convex functions and smooth maps
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
Mirror descent and convex optimization problems with non-smooth inequality constraints
Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
On the complexity of finding first-order critical points in constrained nonlinear optimization
Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
Penalty methods with stochastic approximation for stochastic nonlinear programming
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
A recursive quadratic programming algorithm that uses differentiable exact penalty functions
An exact penalty function method with global convergence properties for nonlinear programming problems
On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
An Exact Penalization Viewpoint of Constrained Optimization
Stochastic Model-Based Minimization of Weakly Convex Functions
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
A Single-Phase, Proximal Path-Following Framework
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization
A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
On the Convergence of Successive Linear-Quadratic Programming Algorithms
Composite Self-Concordant Minimization
A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs
Complexity and performance of an Augmented Lagrangian algorithm
On the learnability and design of output codes for multiclass problems