A homotopy method based on penalty function for nonlinear semidefinite programming
From MaRDI portal
Publication:496592
DOI10.1007/s10898-015-0276-5zbMath1353.90106OpenAlexW2066927392MaRDI QIDQ496592
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0276-5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A homotopy method for nonlinear semidefinite programming
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- 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
- On almost smooth functions and piecewise smooth functions
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- A truncated aggregate smoothing Newton method for minimax problems
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of 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
- Smooth convex approximation to the maximum eigenvalue function
- An interior method for nonconvex semidefinite programs
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- 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
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Semidefinite optimization
- Large-Scale Optimization of Eigenvalues
- 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
- Introduction to Numerical Continuation Methods
- 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
- Penalty and Barrier Methods: A Unified Framework
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Smoothing method for minimax problems
- A filter algorithm for nonlinear semidefinite programming
This page was built for publication: A homotopy method based on penalty function for nonlinear semidefinite programming
