A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
From MaRDI portal
Publication:493049
DOI10.1007/s10957-014-0670-zzbMath1335.90113OpenAlexW2164438160MaRDI QIDQ493049
Ximei Yang, Yinkui Zhang, Hong-Wei Liu
Publication date: 11 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0670-z
Related Items
On the central paths in symmetric cone programming ⋮ A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Stochastic numerical approach for solving second order nonlinear singular functional differential equation ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
Cites Work
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- 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
- 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 Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- 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
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
This page was built for publication: A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
