A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming

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

zbMATH Keywords

polynomial complexity; Jordan algebra; wide neighborhood; infeasible-interior-point method; symmetric cone programming

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C51: Interior-point methods

Related Items

A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, Derivatives of eigenvalues and Jordan frames, A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, Two wide neighborhood interior-point methods for symmetric cone optimization, A new infeasible-interior-point algorithm for linear programming over symmetric cones, A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ⁻¹) iteration complexity, A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization

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