Iteration-complexity of first-order augmented Lagrangian methods for convex programming
From MaRDI portal
Publication:5962727
Recommendations
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- Iteration-complexity of first-order penalty methods for convex programming
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 895182 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An Augmented Primal-Dual Method for Linear Conic Programs
- An augmented Lagrangian function with improved exactness properties
- Introductory lectures on convex optimization. A basic course.
- Iteration-complexity of first-order penalty methods for convex programming
- Local minima and convergence in low-rank semidefinite programming
- Multiplier and gradient methods
- Nonlinear optimization.
- Numerical Optimization
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Smooth minimization of non-smooth functions
Cited in
(42)- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Iteration-complexity of first-order penalty methods for convex programming
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- Augmented Lagrangian optimization under fixed-point arithmetic
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- An optimal method for stochastic composite optimization
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems
- First-order methods for problems with \(O(1)\) functional constraints can have almost the same convergence rate as for unconstrained problems
- An interior point-proximal method of multipliers for convex quadratic programming
- On the complexity of an augmented Lagrangian method for nonconvex optimization
- A linear algebra perspective on the random multi-block ADMM: the QP case
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming
- An adaptive primal-dual framework for nonsmooth convex minimization
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- Faster Lagrangian-based methods in convex optimization
- Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- Stochastic block mirror descent methods for nonsmooth and stochastic optimization
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- Dual descent augmented Lagrangian method and alternating direction method of multipliers
- Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Nonsmooth projection-free optimization with functional constraints
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
- Iteration complexity analysis of dual first-order methods for conic convex programming
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- Inertial accelerated augmented Lagrangian algorithms with scaling coefficients to solve exactly and inexactly linearly constrained convex optimization problems
- Level constrained first order methods for function constrained optimization
- An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints
This page was built for publication: Iteration-complexity of first-order augmented Lagrangian methods for convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962727)
