Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
From MaRDI portal
Publication:1697897
DOI10.1007/s40305-017-0172-4zbMath1411.90356OpenAlexW2621038945MaRDI QIDQ1697897
Chang-He Liu, Yuan-Yuan Huang, You-lin Shang
Publication date: 20 February 2018
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-017-0172-4
polynomial complexityEuclidean Jordan algebrawide neighborhoodsymmetric cone programmingpath-following interior-point algorithm
Related Items
An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Neighborhood-following algorithms for linear programming
- Interior-point methods based on kernel functions for symmetric optimization
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- 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
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- 对称锥规划的邻域跟踪算法
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
This page was built for publication: Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
