Lagrange optimality system for a class of nonsmooth convex optimization
From MaRDI portal
Abstract: In this paper, we revisit the augmented Lagrangian method for a class of nonsmooth convex optimization. We present the Lagrange optimality system of the augmented Lagrangian associated with the problems, and establish its connections with the standard optimality condition and the saddle point condition of the augmented Lagrangian, which provides a powerful tool for developing numerical algorithms. We apply a linear Newton method to the Lagrange optimality system to obtain a novel algorithm applicable to a variety of nonsmooth convex optimization problems arising in practical applications. Under suitable conditions, we prove the nonsingularity of the Newton system and the local convergence of the algorithm.
Recommendations
- scientific article; zbMATH DE number 874651
- A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize
- scientific article; zbMATH DE number 3913573
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces
Cites work
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- An active set strategy based on the augmented Lagrangian formulation for image restoration
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Image Processing and Analysis
- Inverse problems. Tikhonov theory and algorithms
- Lagrange Multiplier Approach to Variational Problems and Applications
- Local convergence of quasi-Newton methods for B-differentiable equations
- Multiplier and gradient methods
- Numerical solution of saddle point problems
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Signal Recovery by Proximal Forward-Backward Splitting
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(3)- A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones
- scientific article; zbMATH DE number 874651 (Why is no real title available?)
- A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize
This page was built for publication: Lagrange optimality system for a class of nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810115)
