Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

DOI10.1007/BF02680568zbMath0922.90136OpenAlexW2072165663MaRDI QIDQ1290671

Martin Wechs, Josef Stoer

Publication date: 3 June 1999

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

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

zbMATH Keywords

sufficient matriceshorizontal linear complementarityinfeasible-interior-point-paths

Mathematics Subject Classification ID

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

Related Items (19)

Sufficient weighted complementarity problems ⋮ A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ On the complexity of analyticity in semi-definite optimization ⋮ A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Two simple proofs for analyticity of the central path in linear programming. ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ Unnamed Item ⋮ Analyticity of the central path at the boundary point in semidefinite programming ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems

Cites Work

• Unnamed Item
• Sufficient matrices and the linear complementarity problem
• A unified approach to interior point algorithms for linear complementary problems
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• On a subclass of \(P_ 0\)
• \(P_ *\)-matrices are just sufficient
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
• Some continuity properties of polyhedral multifunctions
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems

This page was built for publication: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity