On the characterization of Q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
It is admitted that the primal-dual Newton interior-point method can be considered as a damped and perturbed Newton method applied to the Karush-Kuhn-Tucker (KKT) necessary conditions. The KKT conditions involve the vector of primal variables \(x\), the vector of dual variables \(y\) corresponding to equality constraints and the vector of dual variables \(z\) corresponding to the nonnegative constraints on the primal variables \(x\). Introducing some assumptions on the interaction between the primal variable \(x\) and the dual variable \(z\) the authors extend the Boggs-Tolle-Wang characterization of \(Q\)-superlinear convergence for quasi-Newton methods for equality constrained optimization to quasi-Newton interior-point methods for general nonlinear programming in terms of the variables \((x, z)\) alone. Besides the determination of the primary variables, other principal problems such as the choice of the centering parameter and the choice of the steplength parameter are discussed.
- Sequential quadratic programming for large-scale nonlinear optimization
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Local analysis of the feasible primal-dual interior-point method
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
- Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
- scientific article; zbMATH DE number 2064336 (Why is no real title available?)
- The inexact, inexact perturbed, and quasi-Newton methods are equivalent models
- Inexact perturbed Newton methods and applications to a class of Krylov solvers
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- Local convergence of the interior-point Newton method for general nonlinear programming
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
- A local convergence property of primal-dual methods for nonlinear programming
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)
