A primal–dual regularized interior-point method for semidefinite programming
From MaRDI portal
Publication:5268898
DOI10.1080/10556788.2016.1235708zbMath1365.90189OpenAlexW2531901171MaRDI QIDQ5268898
No author found.
Publication date: 21 June 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1235708
regularizationsemidefinite programminginterior-point methoddegeneracySlater's conditionsymmetric quasi-definite
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51) Duality theory (optimization) (49N15)
Related Items
A globally convergent regularized interior point method for constrained optimization ⋮ An interior point-proximal method of multipliers for linear positive semi-definite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook on semidefinite, conic and polynomial optimization
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Applications of semidefinite programming
- A primal-dual regularized interior-point method for convex quadratic programs
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- Solution of Sparse Indefinite Systems of Linear Equations
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On free variables in interior point methods
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- A Spectral Bundle Method for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Symmetric Quasidefinite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Benchmarking optimization software with performance profiles.
