Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
From MaRDI portal
Publication:4971018
DOI10.1137/19M1248972zbMath1451.90161MaRDI QIDQ4971018
Zsolt Darvay, Janez Povh, Petra Renáta Rigó, Tibor Illés
Publication date: 8 October 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
\(P_*(\kappa)\)-linear complementarity problempolynomial iteration complexitycopositivity testcorrector-predictor interior-point algorithmnew search direction
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ A new corrector-predictor interior-point method for symmetric cone optimization ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ On sufficient properties of sufficient matrices ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial interior-point algorithm for monotone linear complementarity problems
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Copositive optimization -- recent developments and applications
- On the computational complexity of membership problems for the completely positive cone and its dual
- Corrector-predictor methods for sufficient linear complementarity problems
- On the complexity of computing the handicap of a sufficient matrix
- Determining the handicap of a sufficient matrix
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- EP theorem for dual linear complementarity problems
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- NP-completeness of the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Criss-cross methods: A fresh view on pivot algorithms
- EP theorems and linear complementarity problems
- Co-NP-completeness of some matrix classification problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A generalized direction in interior point method for monotone linear complementarity problems
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- On a subclass of \(P_ 0\)
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- Criteria for sufficient matrices
- \(P_ *\)-matrices are just sufficient
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A corrector-predictor interior-point method with new search direction for linear optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A path to the Arrow-Debreu competitive market equilibrium
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Copositive Programming
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Equivaence between different formulations of the linear complementarity promblem
- Engineering and Economic Applications of Complementarity Problems
- A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Copositivity tests based on the linear complementarity problem
