A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming

DOI10.1007/S40305-016-0118-2MaRDI QIDQ2630833zbMATH OpenOpenAlexFDO

Authors Dan Wu, Changhe Liu, Youlin Shang

Publication date 22 July 2016

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-016-0118-2

zbMATH Keywords

polynomial complexityEuclidean Jordan algebrawide neighborhoodsymmetric cone programminginfeasible-interior-point algorithm

Mathematics Subject Classification ID

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

Recommendations

• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
• A new wide neighborhood infeasible interior-point algorithm for semidefinite programming
• Two wide neighborhood interior-point methods for symmetric cone optimization
• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• An interior-point method for symmetric optimization based on a new wide neighborhood
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• An improved infeasible interior-point method for symmetric cone linear complementarity problem
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
• A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
• 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 wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A note on an inequality involving Jordan product in Euclidean Jordan algebras
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• An infeasible interior point method for linear complementarity problems over 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
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• Interior-point methods based on kernel functions for symmetric optimization
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Neighborhood-following algorithms for linear programming
• Neighborhood-following algorithms for symmetric cone programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming

Cited in

(10)

• An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
• A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• Two wide neighborhood interior-point methods for symmetric cone optimization
• A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• Neighborhood-following algorithms for symmetric cone programming

This page was built for publication: A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming

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