An equivalency condition of nonsingularity in nonlinear semidefinite programming

DOI10.1007/s11424-010-8057-1zbMath1209.90286OpenAlexW1986844791MaRDI QIDQ625675

Raimundo J. B. de Sampaio, Chengjin Li, Wen-Yu 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)

Related Items

On duality theory for non-convex semidefinite programming

Uses Software

• SDPT3

Cites Work

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

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