A practical relative error criterion for augmented Lagrangians
From MaRDI portal
Publication:378086
DOI10.1007/S10107-012-0528-9zbMATH Open1362.90312OpenAlexW2027347504MaRDI QIDQ378086FDOQ378086
Authors: Jonathan Eckstein, Paulo José da Silva e Silva 
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0528-9
Recommendations
- An augmented Lagrangian function with improved exactness properties
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- scientific article; zbMATH DE number 5077058
- Practical augmented Lagrangian methods for constrained optimization
- scientific article; zbMATH DE number 3910142
- Improving ultimate convergence of an augmented Lagrangian method
- The Augmented Lagrangian Method for Parameter Estimation in Elliptic Systems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- A new family of penalties for augmented Lagrangian methods
- Inexact accelerated augmented Lagrangian methods
convex programmingaugmented Lagrangian methodinexact solution conditionrelative error criterionRockafellar's parametric convex duality framework
Cites Work
- Title not available (Why is that?)
- CUTE
- Benchmarking optimization software with performance profiles.
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convex Analysis
- Title not available (Why is that?)
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Two new weak constraint qualifications and applications
- A relaxed constant positive linear dependence constraint qualification and applications
- On the Maximality of Sums of Nonlinear Monotone Operators
- Local boundedness of nonlinear, monotone operators
- A New Active Set Algorithm for Box Constrained Optimization
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Partial inverse of a monotone operator
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- A practical general approximation criterion for methods of multipliers based on Bregman distances
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- Title not available (Why is that?)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
Cited In (44)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- An inexact ADMM with proximal-indefinite term and larger stepsize
- On Proximal Algorithms with Inertial Effects Beyond Monotonicity
- Efficient alternating minimization methods for variational edge-weighted colorization models
- A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
- Approximate first-order primal-dual algorithms for saddle point problems
- Convergence rates for an inexact ADMM applied to separable convex optimization
- On inexact ADMMs with relative error criteria
- Augmented Lagrangian optimization under fixed-point arithmetic
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
- Some inexact hybrid proximal augmented Lagrangian algorithms
- On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems
- Complexity and performance of an augmented Lagrangian algorithm
- Approximate ADMM algorithms derived from Lagrangian splitting
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods
- An augmented Lagrangian method for state constrained linear parabolic optimal control problems
- Seeking consensus on subspaces in federated principal component analysis
- Error estimation in nonlinear optimization
- A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems
- An inexact proximal generalized alternating direction method of multipliers
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
- Title not available (Why is that?)
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- On FISTA with a relative error rule
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- A survey on some recent developments of alternating direction method of multipliers
- An inexact alternating direction method of multipliers with relative error criteria
- Principled analyses and design of first-order methods with inexact proximal operators
- An extragradient-based alternating direction method for convex minimization
- Inexact alternating direction methods of multipliers for separable convex optimization
Uses Software
This page was built for publication: A practical relative error criterion for augmented Lagrangians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378086)
