Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
type: Item
instance of: scholarly article
title: Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
zbMATH Open document ID: 1411.90356
author: Changhe Liu
author: Yuanyuan Huang
author: Youlin Shang
published in: Journal of the Operations Research Society of China
publication date: 2018-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6841399
zbMATH Keywords: path-following interior-point algorithm
zbMATH Keywords: wide neighborhood
zbMATH Keywords: symmetric cone programming
zbMATH Keywords: Euclidean Jordan algebra
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s40305-017-0172-4
OpenAlex ID: W2621038945
cites work: Q4321748
cites work: Barrier Functions in Interior Point Methods
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: Euclidean Jordan algebras and interior-point algorithms
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: Interior-point methods based on kernel functions for symmetric optimization
cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
cites work: A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
cites work: Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
cites work: Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
cites work: A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
cites work: Neighborhood-following algorithms for linear programming
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
cites work: A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
cites work: 对称锥规划的邻域跟踪算法
cites work: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
cites work: Path-following interior point algorithms based on wide neighborhoods and a new class of directions
cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
DOI: 10.1007/S40305-017-0172-4
description: scientific article; zbMATH DE number 6841399