A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP

DOI10.1137/S1052623495279359MaRDI QIDQ4340809zbMATH OpenFDO

Authors Florian A. Potra, Rongqin Sheng

Publication date 12 June 1997

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1052623495279359

zbMATH Keywords

\(P_ *\)-matricesinfeasible-interior-point algorithmlinear complementarity problemspolynomialitysuperlinear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1864507
• Large-Step Interior Point Algorithms for Linear Complementarity Problems
• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• Large-update interior point algorithm for P_*-linear complementarity problem
• Interior point methods for large-scale linear programming
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
• A full-NT step infeasible interior-point algorithm for mixed symmetric cone LCPs

Cited in

(34)

• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems
• Interior-point methods
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
• Two interior-point methods for nonlinear P_*()-complementarity problems.
• Global convergence enhancement of classical linesearch interior point methods for MCPs
• 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
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
• An infeasible full-NT step IPM for P_() horizontal linear complementarity problem over Cartesian product of symmetric cones
• scientific article; zbMATH DE number 2187082 (Why is no real title available?)
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• scientific article; zbMATH DE number 1864507 (Why is no real title available?)
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• A new second-order corrector interior-point algorithm for P_ ()-LCP
• Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• Hessian distances and their applications in the complexity analysis of interior-point methods
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• A new search direction for full-Newton step interior-point method in P_*()-HLCP
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
• Large-step algorithm for linear complementarity problem with new search direction
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
• New method for determining search directions for interior-point algorithms in linear optimization
• A new path-following algorithm for nonlinear P_* complementarity problems
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• Improved full-Newton step O(nL) infeasible interior-point method for linear optimization

This page was built for publication: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP

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