Publication:4915359
From MaRDI portal
zbMath1292.90229MaRDI QIDQ4915359
Publication date: 10 April 2013
Full work available at URL: http://www.kybernetika.cz/content/2012/5/907
primal-dual method; optimal solutions; semidefinite optimization; polynomial complexity; infeasible interior-point method; Newton-step
Related Items
A full NT-step infeasible interior-point algorithm for semidefinite optimization, A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization, An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Feasibility issues in a primal-dual interior-point method for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A Spectral Bundle Method for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
