An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
From MaRDI portal
Publication:2970393
DOI10.1080/02331934.2016.1267732zbMath1392.90114OpenAlexW2561720919MaRDI QIDQ2970393
Hossein Mansouri, Zsolt Darvay, Soodabeh Asadi
Publication date: 30 March 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1267732
Euclidean Jordan algebrainfeasible interior point methodCartesian product of symmetric cones\(P_\ast(\kappa)\) horizontal linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (11)
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A full-Newton step interior-point method for monotone weighted linear complementarity problems ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A new primal-dual path-following method for convex quadratic programming
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new polynomial-time algorithm for linear programming
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A polynomial path-following interior point algorithm for general linear complementarity problems
- EP theorem for dual linear complementarity problems
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On homogeneous and self-dual algorithms for LCP
- 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
- Similarity and other spectral relations for symmetric cones
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
