On the characterization of Q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
From MaRDI portal
Publication:1908583
zbMATH Open0853.65061MaRDI QIDQ1908583FDOQ1908583
Z. Parada, Héctor Martínez, Richard Tapia
Publication date: 8 December 1996
Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)
nonlinear programmingKarush-Kuhn-Tucker conditionsquasi-Newton methods\(Q\)-superlinear convergenceprimal-dual Newton interior-point method
Cited In (10)
- The inexact, inexact perturbed, and quasi-Newton methods are equivalent models
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Inexact perturbed Newton methods and applications to a class of Krylov solvers
- A local convergence property of primal-dual methods for nonlinear programming
- Local analysis of the feasible primal-dual interior-point method
- Local convergence of the interior-point Newton method for general nonlinear programming
- Sequential quadratic programming for large-scale nonlinear optimization
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
This page was built for publication: On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908583)