Feasible corrector-predictor interior-point algorithm for P_* ()-linear complementarity problems based on a new search direction
From MaRDI portal
Publication:4971018
Recommendations
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
- scientific article; zbMATH DE number 1864507
- A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 6913928 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A corrector-predictor interior-point method with new search direction for linear optimization
- A generalized direction in interior point method for monotone linear complementarity problems
- A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
- A new algorithm for solving self-dual linear optimization problems
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A new predictor-collector algorithm for linear programming
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A path to the Arrow-Debreu competitive market equilibrium
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A predictor-corrector algorithm for linearly constrained convex optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Co-NP-completeness of some matrix classification problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Copositive optimization -- recent developments and applications
- Copositive programming
- Copositivity tests based on the linear complementarity problem
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Corrector-predictor methods for sufficient linear complementarity problems
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Criss-cross methods: A fresh view on pivot algorithms
- Criteria for sufficient matrices
- Determining the handicap of a sufficient matrix
- EP theorem for dual linear complementarity problems
- EP theorems and linear complementarity problems
- Engineering and Economic Applications of Complementarity Problems
- Equivaence between different formulations of the linear complementarity promblem
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- NP-completeness of the linear complementarity problem
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- New interior point algorithms in linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On a subclass of \(P_ 0\)
- On the Implementation of a Primal-Dual Interior Point Method
- On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
- On the complexity of computing the handicap of a sufficient matrix
- On the complexity of following the central path of linear programs by linear extrapolation. II
- On the computational complexity of membership problems for the completely positive cone and its dual
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Polynomial interior point algorithms for general linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Sufficient matrices and the linear complementarity problem
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- \(P_ *\)-matrices are just sufficient
Cited in
(16)- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- Sufficient matrices: properties, generating and testing
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
- Gradient projection method on the sphere, complementarity problems and copositivity
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- A corrector-predictor interior-point method with new search direction for linear optimization
- On sufficient properties of sufficient matrices
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem
- A new corrector-predictor interior-point method for symmetric cone optimization
This page was built for publication: Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4971018)
