An equivalency condition of nonsingularity in nonlinear semidefinite programming

DOI10.1007/S11424-010-8057-1MaRDI QIDQ625675zbMATH OpenOpenAlexFDO

Authors Chengjin Li, Raimundo J. B. de Sampaio, Wenyu Sun

Publication date 25 February 2011

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-010-8057-1

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Equivalence of two nondegeneracy conditions for semidefinite programs
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• Optimality conditions for nonconvex semidefinite programming

Cites work

• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 5583532 (Why is no real title available?)
• A nonsmooth version of Newton's method
• Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
• On filter-successive linearization methods for nonlinear semidefinite programming
• Optimization and nonsmooth analysis
• Optimization theory and methods. Nonlinear programming
• Semidefinite Programming
• Semidefinite optimization
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
• Semismooth Matrix-Valued Functions
• Solving semidefinite programming problems via alternating direction methods
• Solving semidefinite-quadratic-linear programs using SDPT3
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

Cited in

(6)

• An equivalent problem in nonconvex semidefinite programming
• Nonsingularity Conditions for the Fischer–Burmeister System of Nonlinear SDPs
• Equivalence of two nondegeneracy conditions for semidefinite programs
• On duality theory for non-convex semidefinite programming
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs

Describes a project that uses

Uses Software

• SDPT3

This page was built for publication: An equivalency condition of nonsingularity in nonlinear semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625675)