Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
From MaRDI portal
Publication:3462001
DOI10.1142/S1793557115500710zbMATH Open1329.90167MaRDI QIDQ3462001FDOQ3462001
Publication date: 4 January 2016
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Recommendations
- An improved and modified infeasible interior-point method for symmetric optimization
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 6285133
- Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimisation
- New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
Cites Work
- Title not available (Why is that?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Cited In (4)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- An infeasible full NT-step interior point method for circular optimization
- Title not available (Why is that?)
This page was built for publication: Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462001)