A practical relative error criterion for augmented Lagrangians
From MaRDI portal
Publication:378086
DOI10.1007/s10107-012-0528-9zbMath1362.90312OpenAlexW2027347504MaRDI QIDQ378086
Jonathan Eckstein, Paulo J. S. 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
convex programmingaugmented Lagrangian methodinexact solution conditionrelative error criterionRockafellar's parametric convex duality framework
Related Items
A survey on some recent developments of alternating direction method of multipliers, Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, Approximate ADMM algorithms derived from Lagrangian splitting, Inexact alternating direction methods of multipliers for separable convex optimization, On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects, An inexact proximal generalized alternating direction method of multipliers, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, On Proximal Algorithms with Inertial Effects Beyond Monotonicity, An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization, Principled analyses and design of first-order methods with inexact proximal operators, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems, On FISTA with a relative error rule, Augmented Lagrangian optimization under fixed-point arithmetic, The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion, On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, An inexact alternating direction method of multipliers with relative error criteria, Error estimation in nonlinear optimization, An extragradient-based alternating direction method for convex minimization, On inexact ADMMs with relative error criteria, Efficient alternating minimization methods for variational edge-weighted colorization models, Convergence rates for an inexact ADMM applied to separable convex optimization, A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods, On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming, A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis, 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 the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, Approximate first-order primal-dual algorithms for saddle point problems, Complexity and performance of an Augmented Lagrangian algorithm, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance, An inexact ADMM with proximal-indefinite term and larger stepsize
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial inverse of a monotone operator
- A relaxed constant positive linear dependence constraint qualification and applications
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- A practical general approximation criterion for methods of multipliers based on Bregman distances
- 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
- Local boundedness of nonlinear, monotone operators
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A New Active Set Algorithm for Box Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- CUTE
- 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 Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convex Analysis
- On the Maximality of Sums of Nonlinear Monotone Operators
- Benchmarking optimization software with performance profiles.
