A homotopy method based on penalty function for nonlinear semidefinite programming
From MaRDI portal
Publication:496592
DOI10.1007/S10898-015-0276-5zbMATH Open1353.90106OpenAlexW2066927392MaRDI QIDQ496592FDOQ496592
Authors: Bo Yu, YanXi Li, Li Yang 
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
Recommendations
- A homotopy method for nonlinear semidefinite programming
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A line search exact penalty method for nonlinear semidefinite programming
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
Cites Work
- 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
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- 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
- Introduction to Numerical Continuation Methods
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Title not available (Why is that?)
- 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
- 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?)
- Smoothing method for minimax problems
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Smooth convex approximation to the maximum eigenvalue function
- 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
- A homotopy method for nonlinear semidefinite programming
- Robust Control via Sequential Semidefinite Programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- 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
- On almost smooth functions and piecewise smooth functions
- Penalty and Barrier Methods: A Unified Framework
- Large-Scale Optimization of Eigenvalues
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- A truncated aggregate smoothing Newton method for minimax problems
Cited In (1)
Uses Software
This page was built for publication: A homotopy method based on penalty function for nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496592)
