A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
From MaRDI portal
Publication:378283
DOI10.1007/S10957-013-0303-YzbMATH Open1274.90389OpenAlexW2051178311MaRDI QIDQ378283FDOQ378283
Authors: Ximei Yang, Hongwei Liu, Changhe 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
Recommendations
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A new infeasible-interior-point algorithm for linear programming over symmetric cones
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
polynomial complexityJordan algebrawide neighborhoodinfeasible-interior-point methodsymmetric cone programming
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Title not available (Why is that?)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Feasibility issues in a primal-dual interior-point method for linear programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- 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
- Function spaces and reproducing kernels on bounded symmetric domains
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- New interior point algorithms in linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Superlinear convergence of interior-point algorithms for semidefinite programming
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Barrier Functions in Interior Point Methods
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Interior-point methods based on kernel functions for symmetric optimization
- Linear programming: foundations and extensions
Cited In (40)
- 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
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- Title not available (Why is that?)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Derivatives of eigenvalues and Jordan frames
- A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
- A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
- A new infeasible-interior-point algorithm for linear programming over symmetric cones
- 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
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- A corrector-predictor arc search interior-point algorithm for symmetric optimization
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
- A predictor-corrector infeasible-interior-point method for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones with \(O\left( \sqrt{\mathrm{cond}(G)}(1+\kappa)^2 r\log \varepsilon^{-1} \right)\) iteration complexity
- An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
This page was built for publication: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378283)
