A homotopy method for nonlinear semidefinite programming
From MaRDI portal
Publication:360377
DOI10.1007/S10589-013-9545-8zbMATH Open1298.90067OpenAlexW2152463942MaRDI QIDQ360377FDOQ360377
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
Recommendations
- A homotopy method based on penalty function for nonlinear semidefinite programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Noninterior continuation method for solving semidefinite programming
- A homotopy method for nonlinear second-order cone programming
- A noninterior point homotopy method for semi-infinite programming problems
Cites Work
- Benchmarks for Optimization Software
- PENNON: A code for convex nonlinear and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Solving semidefinite-quadratic-linear programs using SDPT3
- Title not available (Why is that?)
- Linear Matrix Inequalities in System and Control Theory
- Title not available (Why is that?)
- 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
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- An independent benchmarking of SDP and SOCP solvers
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- First and second order analysis of nonlinear semidefinite programs
- Optimality conditions for nonconvex semidefinite programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Title not available (Why is that?)
- On the Nesterov--Todd Direction in Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- An interior method for nonconvex semidefinite programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- 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
- Robust Control via Sequential Semidefinite Programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- Ellipsoidal approximation of the stability domain of a polynomial
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- A filter algorithm for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
Cited In (9)
- A novel approach for solving semidefinite programs
- A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- Solving a class of semi-infinite programming problems by homotopy methods
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- 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 homotopy method based on penalty function for nonlinear semidefinite programming
- Homotopy techniques in linear programming
Uses Software
This page was built for publication: A homotopy method for nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360377)
