A quadratically convergent O(( +1) n L)-iteration algorithm for the P_ *()-matrix linear complementarity problem

DOI10.1007/BF01585565MaRDI QIDQ1906276zbMATH OpenFDO

Authors Jian-Ming Miao

Publication date 2 September 1996

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

Full work available at URL https://doi.org/10.1007/BF01585565

zbMATH Keywords

interior-point predictor-corrector algorithmlinear complementaritypolynomial-time algorithmquadratic convergence

Mathematics Subject Classification ID

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

Recommendations

• A predictor-corrector interior-point algorithm for P_*()-linear complementarity problems
• scientific article; zbMATH DE number 1864507
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence

Cites work

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

Cited in

(45)

• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• d-orientation sequences for continuous functions and nonlinear complementarity problems
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
• On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A corrector-predictor path-following method for convex quadratic symmetric cone optimization
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
• A strongly polynomial rounding procedure yielding a maximally complementary solution for P_*() linear complementarity problems
• An asymptotical O((k+1)n^3L) affine scaling algorithm for the P_*(k)-matrix linear complementarity problem
• Kernel-function based primal-dual algorithms for P_* ( ) linear complementarity problems
• The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
• scientific article; zbMATH DE number 6913928 (Why is no real title available?)
• Primal-dual algorithms for P_() linear complementarity problems based on kernel-function with trigonometric barrier term
• An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• A predictor-corrector interior-point algorithm for P_*()-linear complementarity problems
• A new second-order corrector interior-point algorithm for P_ ()-LCP
• A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• A new search direction for full-Newton step interior-point method in P_*()-HLCP
• Corrector-predictor methods for sufficient linear complementarity problems
• Interior point algorithm for \(P_*\) nonlinear complementarity problems
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
• A feasible interior-point method with full-Newton step for P_* ( )-weighted linear complementarity problem via the algebraically equivalent transformation
• Complexity analysis of a predictor-corrector interior-point algorithm for P_()-weighted linear complementarity problems
• New predictor-corrector interior-point algorithm with AET function having inflection points
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
• 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 full-Newton step infeasible interior-point algorithm for P_ () linear complementarity problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906276)