Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
From MaRDI portal
Publication:3608988
DOI10.1137/070681235zbMATH Open1190.90116OpenAlexW2056854783MaRDI QIDQ3608988FDOQ3608988
Authors: Zi Xian Chan, Defeng Sun 
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070681235
Recommendations
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Nonsingularity in second-order cone programming via the smoothing metric projector
- Equivalence of two nondegeneracy conditions for semidefinite programs
- On metric regularity for weakly almost piecewise smooth functions and some applications in nonlinear semidefinite programming
semidefinite programmingvariational analysisquadratic convergencenonsingularityconstraint nondegeneracystrong regularity
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)
Cited In (44)
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- Quadratic model updating with gyroscopic structure from partial eigendata
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
- A feasible method for general convex low-rank SDP problems
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- Spectral operators of matrices
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- On metric regularity for weakly almost piecewise smooth functions and some applications in nonlinear semidefinite programming
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- Jacobian uniqueness theorem for nonlinear semidefinite programming
- On the simplicity and conditioning of low rank semidefinite programs
- Variational analysis of norm cones in finite dimensional Euclidean spaces
- Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Equivalence of two nondegeneracy conditions for semidefinite programs
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- Certifying the global optimality of quartic minimization over the sphere
- Aubin property and uniqueness of solutions in cone constrained optimization
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- Grothendieck inequalities for semidefinite programs with rank constraint
- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
- On saddle points in semidefinite optimization via separation scheme
- Nonsingularity in second-order cone programming via the smoothing metric projector
- Conditional quadratic semidefinite programming: examples and methods
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
- Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming
- Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector
- Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
- Newton's method for computing the nearest correlation matrix with a simple upper bound
- Weak notions of nondegeneracy in nonlinear semidefinite programming
This page was built for publication: Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608988)
