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

DOI10.1007/BF02680568MaRDI QIDQ1290671zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• The analyticity of interior-point-paths at strictly complementary solutions of linear programs
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• High order infeasible-interior-point methods for solving sufficient linear complementarity problems

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
• A unified approach to interior point algorithms for linear complementary problems
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
• On a subclass of \(P_ 0\)
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
• Some continuity properties of polyhedral multifunctions
• Sufficient matrices and the linear complementarity problem
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• \(P_ *\)-matrices are just sufficient

Cited in

(19)

• Analyticity of the central path at the boundary point in semidefinite programming
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• Corrector-predictor methods for sufficient linear complementarity problems
• A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
• Two simple proofs for analyticity of the central path in linear programming.
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems
• Sufficient weighted complementarity problems
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• Standard embedding for linear complementarity problems
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
• A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP
• Analyticity of weighted central paths and error bounds for semidefinite programming
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• On the complexity of analyticity in semi-definite optimization

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

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