A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
From MaRDI portal
Publication:627154
DOI10.1016/j.amc.2010.11.049zbMath1210.65111OpenAlexW2072933255MaRDI QIDQ627154
Publication date: 21 February 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.049
semidefinite programmingpolynomial complexityinfeasible interior-point methodskernel functionsfull Nesterov-Todd steps
Related Items (6)
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization ⋮ A full NT-step infeasible interior-point algorithm for semidefinite optimization ⋮ A full-Newton step interior-point algorithm for linear optimization based on a finite barrier ⋮ Simplified infeasible interior-point algorithm for linear optimization based on a simple function ⋮ Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
Cites Work
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
This page was built for publication: A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
