A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem

DOI10.1007/BF01585565zbMath0844.90097MaRDI QIDQ1906276

Jian-Ming Miao

Publication date: 2 September 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear complementarityquadratic convergencepolynomial-time algorithminterior-point predictor-corrector algorithm

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP, Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP, Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points, A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem, A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term, A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, Corrector-predictor methods for sufficient linear complementarity problems, Interior point algorithm for \(P_*\) nonlinear complementarity problems, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, Kernel-function Based Primal-Dual Algorithms forP_*(κ) Linear Complementarity Problems, Unnamed Item, A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step, On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems, \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP_∗(κ)-LCP over symmetric cones, A new second-order corrector interior-point algorithm for P*(k)-LCP, An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A class of linear complementarity problems solvable in polynomial time
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An interior point potential reduction algorithm for the linear complementarity problem
• A new polynomial time method for a linear complementarity problem
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A Partition Theorem for Euclidean n-Space