The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming

DOI10.1007/s10107-007-0105-9zbMath1190.90117OpenAlexW2004209776MaRDI QIDQ927160

Defeng Sun, Jie Sun, Li-wei Zhang

Publication date: 4 June 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0105-9

zbMATH Keywords

Rate of convergenceNonlinear semidefinite programmingVariational analysisThe augmented Lagrangian method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonsmooth analysis (49J52)

Related Items

A stochastic approximation method for convex programming with many semidefinite constraints, A globally convergent QP-free algorithm for nonlinear semidefinite programming, On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints, Safeguarded Augmented Lagrangian Methods in Banach Spaces, Correlation stress testing for value-at-risk: an unconstrained convex optimization approach, Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, Certifying the global optimality of quartic minimization over the sphere, Augmented Lagrangian methods for convex matrix optimization problems, A homotopy method for nonlinear semidefinite programming, A perturbation approach for an inverse quadratic programming problem, An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems, On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, Polynomial time solvability of non-symmetric semidefinite programming, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming, A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs, An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities, A nonconvex model with minimax concave penalty for image restoration, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, Study on convex optimization with least constraint violation under a general measure, The augmented Lagrangian method can approximately solve convex optimization with least constraint violation, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds, The rate of convergence of proximal method of multipliers for equality constrained optimization problems, A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming, An implementable augmented Lagrange method for solving fixed point problems with coupled constraints, A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming, A filter-type method for solving nonlinear semidefinite programming, On duality theory for non-convex semidefinite programming, On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints, The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones, On the characterizations of solutions to perturbed l₁ conic optimization problem, A filter method for nonlinear semidefinite programming with global convergence, A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming, The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion, A homotopy method based on penalty function for nonlinear semidefinite programming, Inverse semidefinite quadratic programming problem with \(l_1\) norm measure, Inverse quadratic programming problem with \(l_1\) norm measure, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, On the approximate augmented Lagrangian for nonlinear symmetric cone programming, A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness, A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness, Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems, Inexact non-interior continuation method for monotone semidefinite complementarity problems, Nonlinear rescaling Lagrangians for nonconvex semidefinite programming, A class of nonlinear Lagrangians for nonconvex second order cone programming, A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming, An augmented Lagrangian method for a class of Inverse quadratic programming problems, Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property, Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved, An alternating direction method for solving a class of inverse semi-definite quadratic programming problems, No Gap Second-order Optimality Conditions for a Matrix Cone Programming Induced by the Nuclear Norm, Parabolic regularity in geometric variational analysis, Optimality conditions and global convergence for nonlinear semidefinite programming, Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming, Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, The decompositions with respect to two core non-symmetric cones, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming, A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming, Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization, Augmented Lagrangian method for second-order cone programs under second-order sufficiency, A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming, An alternating direction method for solving convex nonlinear semidefinite programming problems, A perturbation approach for an inverse quadratic programming problem over second-order cones, A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming, A primal-dual interior point trust-region method for nonlinear semidefinite programming, On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, On filter-successive linearization methods for nonlinear semidefinite programming, Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming, Unnamed Item, The rate of convergence of proximal method of multipliers for nonlinear programming, On saddle points in semidefinite optimization via separation scheme, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, Confidence structural robust optimization by non-linear semidefinite programming-based single-level formulation

Uses Software

• COMPleib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• Computing a nearest symmetric positive semidefinite matrix
• Merit functions for semi-definite complementarity problems
• Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
• Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
• On analyticity of functions involving eigenvalues
• Sensitivity analysis of generalized equations
• On concepts of directional differentiability
• Über monotone Matrixfunktionen
• A nonsmooth version of Newton's method
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Perturbation analysis of second-order cone programming problems
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints
• Lagrange Multipliers and Optimality
• Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
• Optimization and nonsmooth analysis
• On Penalty and Multiplier Methods for Constrained Minimization
• Monotone Operators and the Proximal Point Algorithm
• Semismooth and Semiconvex Functions in Constrained Optimization
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
• Solving nonconvex SDP problems of structural optimization with stability control
• Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints
• On the basic theorem of complementarity
• ON MATRICES DEPENDING ON PARAMETERS
• Semismooth Matrix-Valued Functions
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
• Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
• Definite and Semidefinite Quadratic Forms
• A further result on an implicit function theorem for locally Lipschitz functions