An equivalency condition of nonsingularity in nonlinear semidefinite programming
From MaRDI portal
Publication:625675
DOI10.1007/S11424-010-8057-1zbMATH Open1209.90286OpenAlexW1986844791MaRDI QIDQ625675FDOQ625675
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
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
- Solving semidefinite-quadratic-linear programs using SDPT3
- Optimization theory and methods. Nonlinear programming
- Semidefinite Programming
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Semidefinite optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On filter-successive linearization methods for nonlinear semidefinite programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Solving semidefinite programming problems via alternating direction methods
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- Title not available (Why is that?)
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
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
- An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
Uses Software
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)
