A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
From MaRDI portal
Publication:378283
DOI10.1007/s10957-013-0303-yzbMath1274.90389MaRDI QIDQ378283
Ximei Yang, Chang-He Liu, Hong-Wei Liu
Publication date: 11 November 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0303-y
polynomial complexity; Jordan algebra; wide neighborhood; infeasible-interior-point method; symmetric cone programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Superlinear convergence of interior-point algorithms for semidefinite programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Linear programming: foundations and extensions
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- 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
- Function spaces and reproducing kernels on bounded symmetric domains
- Interior-point methods based on kernel functions for symmetric optimization
- 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
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- 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
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- 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
