On the local and global convergence of a reduced Quasi-Newton method1

DOI10.1080/02331938908843462zbMath0676.90061OpenAlexW2104004323MaRDI QIDQ3832325

Gilbert, Jean Charles

Publication date: 1989

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938908843462

zbMATH Keywords

global convergencelocal convergencesuperlinear convergencesuccessive quadratic programmingexact penalty functionstep-size selectionnonlinear equality constraintsarc searchreduced quasi-Newton methods

Mathematics Subject Classification ID

Related Items (5)

Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization ⋮ Global convergence of inexact reduced sqp methods ⋮ Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité ⋮ Numerical solution of a nonlinear parabolic control problem by a reduced SQP method ⋮ On the order of convergence of Broyden's method. Faster convergence on mixed linear-nonlinear systems of equations and a conjecture on the q-order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing a differentiable function over a differential manifold
• A globally convergent method for nonlinear programming
• Variants of the reduced Newton method for nonlinear equality constrained optimization problems
• On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
• An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
• On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
• An example of irregular convergence in some constrained optimization methods that use the projected hessian
• Properties of a representation of a basis for the null space
• Newton's method for constrained optimization
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Continuity of the null space basis and constrained optimization
• Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
• A surperlinearly convergent algorithm for constrained optimization problems
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• Efficiently Converging Minimization Methods Based on the Reduced Gradient
• Quasi-Newton Methods, Motivation and Theory
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Algorithms for nonlinear constraints that use lagrangian functions
• On the Use of Approximations in Algorithms for Optimization Problems with Equality and Inequality Constraints

This page was built for publication: On the local and global convergence of a reduced Quasi-Newton method¹