Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
From MaRDI portal
Publication:4979787
DOI10.1080/01630563.2013.836107zbMath1322.90101OpenAlexW2093754347MaRDI QIDQ4979787
Xinze Liu, Chang-He Liu, Hong-wei Liu
Publication date: 19 June 2014
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2013.836107
linear complementarity probleminterior-point methodspolynomial complexityEuclidean Jordan algebraMehrotra-type algorithm
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (10)
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP ⋮ On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
Cites Work
- Unnamed Item
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- A unified approach to interior point algorithms for linear complementary problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- 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
- On a commutative class of search directions for linear programming over symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A long-step primal--dual algorithm for the symmetric programming problem
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
