Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
From MaRDI portal
Abstract: Strong variational sufficiency is a newly proposed property, which turns out to be of great use in the convergence analysis of multiplier methods. However, what this property implies for non-polyhedral problems remains a puzzle. In this paper, we prove the equivalence between the strong variational sufficiency and the strong second order sufficient condition (SOSC) for nonlinear semidefinite programming (NLSDP), without requiring the uniqueness of multiplier or any other constraint qualifications. Based on this characterization, the local convergence property of the augmented Lagrangian method (ALM) for NLSDP can be established under strong SOSC in the absence of constraint qualifications. Moreover, under the strong SOSC, we can apply the semi-smooth Newton method to solve the ALM subproblems of NLSDP as the positive definiteness of the generalized Hessian of augmented Lagrangian function is satisfied.
Recommendations
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
Cites work
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Characterization of metric regularity of subdifferentials
- Characterization of the robust isolated calmness for a class of conic programming problems
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- Convex Analysis
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- First Order Conditions for General Nonlinear Optimization
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Full stability in finite-dimensional optimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 7483223 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization
- Local convergence analysis of augmented Lagrangian methods for piecewise linear-quadratic composite optimization problems
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Parabolic regularity in geometric variational analysis
- Perturbation analysis of second-order cone programming problems
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Regularity and stability for the mathematical programming problem in Banach spaces
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
- Semismooth Matrix-Valued Functions
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
- Strongly Regular Generalized Equations
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Variational Analysis
- Variational convexity and the local monotonicity of subgradient mappings
- Variational Convexity of Functions and Variational Sufficiency in Optimization
Cited in
(8)- A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
- Variational and strong variational convexity in infinite-dimensional variational analysis
- Primal-dual stability in local optimality
- Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming
- Second-order subdifferential optimality conditions in nonsmooth optimization
- Relationships between global and local monotonicity of operators
- Characterizations of strong variational sufficiency in general models of composite optimization
- The augmented Lagrangian methods: overview and recent advances
This page was built for publication: Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071884)
