Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5583532
- Semismooth Newton methods for solving semi-infinite programming problems
- A semismooth Newton method for nonlinear symmetric cone programming
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- A non-interior smoothing algorithm for semidefinite programming
- A nonmonotone semismooth inexact Newton method
- scientific article; zbMATH DE number 1424225
- On methods for solving nonlinear semidefinite optimization problems
- Global Newton-type methods and semismooth reformulations for NCP
Cites work
- A new statistical approach for the analysis of uncertain systems
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- Differential properties of the symmetric matrix-valued Fischer-Burmeister function
- scientific article; zbMATH DE number 1495709 (Why is no real title available?)
- scientific article; zbMATH DE number 5583532 (Why is no real title available?)
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Nonsingularity Conditions for the Fischer–Burmeister System of Nonlinear SDPs
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
- Optimization and nonsmooth analysis
- Robust Control via Sequential Semidefinite Programming
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
Cited in
(2)
This page was built for publication: Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357005)