On the convergence rate of Newton interior-point methods in the absence of strict complementarity
From MaRDI portal
Publication:1816402
DOI10.1007/BF00249644zbMath0862.90120MaRDI QIDQ1816402
Yin Zhang, Richard A. Tapia, Amr S. El-Bakry
Publication date: 19 December 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
linear complementarityduality gapconvergence rate\(Q_ 1\)-factorNewton interior-point methodsTapia indicators
Related Items
Convergence rate of primal dual reciprocal Barrier Newton interior-point methods, Unnamed Item, Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence behavior of interior-point algorithms
- Test examples for nonlinear programming codes
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- Local convergence of interior-point algorithms for degenerate monotone LCP
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition