betaFeedback

WorksMathematics

Augmented Lagrangian methods with Nesterov acceleration for convex optimization with nonlinear inequality constraints

Abstract

In this paper, we develop Nesterov accelerated augmented Lagrangian methods for composite convex optimization with nonlinear inequality constraints. The methods are derived through a compatible discretization of inertial primal-dual dynamics, yielding a unified framework that couples difference extrapolation of the constraint mapping with a projected multiplier. Under convexity and weighted summability of the primal stationarity errors, we prove boundedness of the primal-dual iterates and simultaneous O(k−2)\mathcal O(k^{-2}) last-iterate rates for the objective residual and constraint violation. Under strict parameter conditions, the primal-dual sequence converges to a Karush-Kuhn-Tucker pair, and both residuals improve to o(k−2)o(k^{-2}). These results require no strong convexity of the objective or constraints. Numerical experiments examine the performance of the proposed methods.

Paper details

vlnc:W_2zfmxuwv
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…