50
Views
18
CrossRef citations to date
0
Altmetric
Miscellany

On the local superlinear convergence of a Newton-type method for LCP under weak conditions

Pages 83-107 | Received 20 May 1994, Accepted 20 Apr 1995, Published online: 29 Mar 2007

References

  • Adler , I. and Monteiro , R. 1990 . Limiting behavior of the affine scaling continuous trajectories for linear programming problems . Contemporary Mathematics , 114 : 189 – 211 .
  • Aganagié , M. and Cottle , R.W. 1979 . A note on Q-matrices . Mathematical Programming , 16 : 374 – 377 .
  • Cottle , R.W. , Pang , J.S. and Stone , R.E. 1992 . The linear complementarity problem , Academic Press .
  • Fischer , A. 1992 . A special Newton-type optimization method . Optimization , 24 : 269 – 284 .
  • Fischer A. A globally and locally quadratically convergent Newton-type method for positive semi-definite linear complementarity problems Department of Mathematics Technical University of Dresden Dresden 1992 Preprint MATH-NM-04—1992, Germany, to appear in JOTA, 86 (1995)
  • Fischer , A. 1993 . On the local superlinear convergence of a Newton-type method for LCP under weak conditions , Dresden, , Germany : Technical University of Dresden . Preprint MATH-NM-07-1993, Department of Mathematics
  • Kanzow C. Global convergence properties of some iterative methods for linear complementarity problems Institute of Applied Mathematics University of Hamburg Hamburg, Germany 1993 Preprint 72,to appear in SIAM Journal on Optimization
  • Kojima , M. , Mizuno , S. and Yoshise , A. 1991 . An O iteration potential reduction algorithm for linear complementarity problems . Mathematical Programming , 50 : 331 – 342 .
  • Luo Z.-Q. Mangasarian O.L. Ren J. Solodov M.V. New error bounds for the linear complementarity problem Mathematics of Operations Research Computer Sciences Department, University of Wisconsin Madison, WI,USA 1992 Technical Report 1112, to appear in
  • Luo , Z.Q. and Tseng , P. 1992 . Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem . SIAM Journal on Optimization , 2 : 43 – 54 .
  • Mizuno , S. 1994 . A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition , Germany : University of Wurzburg . Technical Report Nr. 214, Institute of Mathematics
  • Monteiro , R.D.C. and Wright , S.J. 1993 . Local convergence of interior-point algorithms for degeneβate monotone LCP Argonne, , USA Preprint MCS-P357-0493, Mathematics and Computer Science Division, Argonne National Laboratory
  • Potra , F.A. 1992 . A quadratically convergent infeasible interior-point algorithm for linear programming , Iowa City, , USA : University of Iowa . Report No. 28, Department of Mathematics
  • Potra , F.A. 1994 . A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points . Mathematical Programming , 67 : 383 – 406 .
  • Potra , F.A. and Sheng , R. 1994 . A superlinearly convergent infeasible-interior-point algorithm for degenerate LCP , Iowa City, , USA : University of Iowa . Report No. 66, Department of Mathematics
  • Robinson , S.M. 1981 . Some continuity properties of polyhedral multifunctions . Mathematical Programέing Study , 14 : 206 – 214 .
  • Tseng , P. 1994 . Growth behaviour of a class of merit functions for the nonlinear complementarity problem , Seattle, , USA : University of Washington . Technical Report, Department of Mathematics
  • Wright , Sj . 1994 . An infeasible interior point algorithm for linear complementarity problems . Mathemaδical Programming , 67 : 29 – 51 .
  • Ye , Y. 1991 . On the finite convergence of interior-point algorithms for linear programming , Iowa City, , USA : University of Iowa . Working paper 91-5, Department of Management Sciences
  • Ye , Y. and Anstreicher , K. 1993 . On quadratic and O convergence of a predictor-corrector algorithm for LCP . Mathematical Programming , 62 : 537 – 551 .
  • Ye , Y. , Güller , O. , Tapia , A. and Zhang , Y. 1993 . A quadratically convergent -iteration algorithm for linear programming . Mathematical Programming , 59 : 151 – 162 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.