A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization

DOI10.1080/01630563.2015.1065886zbMath1332.90343OpenAlexW2183501439MaRDI QIDQ2795090

Behrouz Kheirfam

Publication date: 18 March 2016

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2015.1065886

zbMATH Keywords

polynomial complexityinfeasible interior-point methodfull Nesterov-Todd stepsecond-order cone optimization

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• Applications of second-order cone programming
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Second-order cone programming
• Similarity and other spectral relations for symmetric cones
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization