A primal-dual infeasible interior-point algorithm for second-order cone programming

MaRDI QIDQ2916483zbMATH OpenFDO

Authors Jingyong Tang, Guoping He

Publication date 5 October 2012

Published in Journal of Shandong University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

infeasible interior-point algorithmpolynomial complexitysecond-order cone programming

Mathematics Subject Classification ID

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

Recommendations

• An inexact infeasible interior-point algorithm for second-order cone programming
• An inexact infeasible-interior-point algorithm for second-order cone programming
• An infeasible interior point algorithm for the second-order cone programming
• Inexact infeasible interior point algorithm for the second-order cone program
• An infeasible-interior-point predictor-corrector algorithm for the second-order cone program

Cited in

(16)

• An infeasible-interior-point predictor-corrector algorithm for the second-order cone program
• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
• The primal-dual second-order cone approximations algorithm for symmetric cone programming
• An infeasible interior-point algorithm for stochastic second-order cone optimization
• A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
• An inexact infeasible interior-point algorithm for second-order cone programming
• Inexact infeasible interior point algorithm for the second-order cone program
• An inexact infeasible-interior-point algorithm for second-order cone programming
• An infeasible interior point algorithm for the second-order cone programming
• A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
• A primal–dual interior point method for nonlinear optimization over second-order cones
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
• An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
• An O( n L) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
• Constraint consensus methods for finding interior feasible points in second-order cones
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step

This page was built for publication: A primal-dual infeasible interior-point algorithm for second-order cone programming

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