Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points

DOI10.1137/0806018zbMATH Open0854.90135OpenAlexW2034018955MaRDI QIDQ4884039FDOQ4884039

Authors: Stephen C. Billups, Michael C. Ferris 

Publication date: 19 January 1997

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

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

Recommendations

• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• scientific article; zbMATH DE number 2195332
• A potential-reduction algorithm for linear complementarity problems
• scientific article; zbMATH DE number 1047678

zbMATH Keywords

infeasible interior-point methodsbox-constrained linear complementarityglobal linear convergence rate

Mathematics Subject Classification ID

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

Cited In (5)

• Counterexample to a Conjecture on an Infeasible Interior-Point Method
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• A smoothing Gauss-Newton method for the generalized HLCP
• Reducing a monotone horizontal LCP to an LCP
• On the extended linear complementarity problem

This page was built for publication: Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points

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