A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization

DOI10.1007/S40305-013-0032-9MaRDI QIDQ743780zbMATH OpenOpenAlexFDO

Authors Behrouz Kheirfam

Publication date 30 September 2014

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-013-0032-9

zbMATH Keywords

polynomial complexityfull Nesterov-Todd stepsymmetric cone optimizationtarget-following

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• scientific article; zbMATH DE number 6285133
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 4183197 (Why is no real title available?)
• A Jordan-algebraic approach to potential-reduction algorithms
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A weighted-path-following method for linear optimization
• A weighted-path-following method for monotone horizontal linear complementarity problem
• A weighted-path-following method for the linear complementarity problem
• Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
• Barrier Functions in Interior Point Methods
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• New interior point algorithms in linear programming
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Primal-dual target-following algorithms for linear programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Similarity and other spectral relations for symmetric cones

Cited in

(8)

• A polynomial-time weighted path-following interior-point algorithm for linear optimization
• The Nesterov-Todd direction and its relation to weighted analytic centers
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
• A weighted-path-following method for symmetric cone linear complementarity problems
• An algorithm for nonsymmetric conic optimization inspired by MOSEK
• A power penalty method for second-order cone nonlinear complementarity problems

This page was built for publication: A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743780)