Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
From MaRDI portal
Publication:1938082
DOI10.1007/s11075-012-9567-9zbMath1277.90090OpenAlexW1975412684MaRDI QIDQ1938082
Le Han, Shujun Bi, Shaohua Pan
Publication date: 1 February 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9567-9
Related Items
A new smooth NCP function for solving semidefinite nonlinear complementarity problems, Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming, The Jacobian consistency of a one-parametric class of smoothing functions for SOCCP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Merit functions for semi-definite complementarity problems
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Non-interior continuation methods for solving semidefinite complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Nonsmooth Equations: Motivation and Algorithms
- Nonsingularity Conditions for the Fischer–Burmeister System of Nonlinear SDPs
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- A Nonmonotone Line Search Technique for Newton’s Method
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Semidefinite Programming
- Regularization Methods for 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
