A homotopy method for nonlinear semidefinite programming
From MaRDI portal
Publication:360377
DOI10.1007/S10589-013-9545-8zbMath1298.90067OpenAlexW2152463942MaRDI QIDQ360377
Publication date: 26 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9545-8
Related Items (6)
Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ A homotopy method based on penalty function for nonlinear semidefinite programming ⋮ On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming ⋮ A primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ A novel approach for solving semidefinite programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Benchmarks for Optimization Software
- A primal-dual interior point method for nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- First and second order analysis of nonlinear semidefinite programs
- An independent benchmarking of SDP and SOCP solvers
- Optimality conditions for nonconvex semidefinite programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- An interior method for nonconvex semidefinite programs
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Semidefinite optimization
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- PENNON: A code for convex nonlinear and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Robust Control via Sequential Semidefinite Programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- An Interior-Point Method for Semidefinite Programming
- Ellipsoidal approximation of the stability domain of a polynomial
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A filter algorithm for nonlinear semidefinite programming
This page was built for publication: A homotopy method for nonlinear semidefinite programming
