Local convergence of interior-point algorithms for degenerate LCP
Conference
·
OSTI ID:36295
Most asymptotic convergence analysis of interior-point algorithms for monotone linear complementarily problems assumes that the problem is nondegenerate, that is, the solution set contains a strictly complementary solution. We investigate the behavior of these algorithms when this assumption is removed. We show that a large class of infeasible-interior point algorithms can not achieve superlinear convergence when the LCP is degenerate. We also give a feasible interior-point algorithm for degenerate monotone LCP with a reasonable linear rate, depending on the {open_quotes}size{close_quotes} of the degeneracy.
- OSTI ID:
- 36295
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the existence and convergence of the central path for convex programming
A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition
A superlinear infeasible-interior-point algorithm for monotone complementarity problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36296
A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36289
A superlinear infeasible-interior-point algorithm for monotone complementarity problems
Technical Report
·
Thu Oct 31 23:00:00 EST 1996
·
OSTI ID:406125