On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
From MaRDI portal
Publication:3681851
DOI10.1137/0721051zbMath0566.65046OpenAlexW2082314805MaRDI QIDQ3681851
Andrew R. Conn, Thomas F. Coleman
Publication date: 1984
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6349
Related Items (35)
Properties of a representation of a basis for the null space ⋮ A convergent secant method for constrained optimization ⋮ The local convergence of the Byrd-Schnabel algorithm for constrained optimization ⋮ Two-step and three-step Q-superlinear convergence of SQP methods ⋮ A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization ⋮ A heuristic algorithm for nonlinear programming ⋮ An analysis of reduced Hessian methods for constrained optimization ⋮ Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization ⋮ Continuity of the null space basis and constrained optimization ⋮ Geometric notes on optimization with equality constraints ⋮ A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares ⋮ A cautious BFGS update for reduced Hessian SQP ⋮ A secant algorithm with line search filter method for nonlinear optimization ⋮ Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité ⋮ Partitioned quasi-Newton methods for nonlinear equality constrained optimization ⋮ Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization ⋮ On the local and global convergence of a reduced Quasi-Newton method1 ⋮ Numerical solution of a nonlinear parabolic control problem by a reduced SQP method ⋮ A reduced Hessian SQP method for inequality constrained optimization ⋮ An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints ⋮ Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization ⋮ An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization ⋮ A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization ⋮ Null-Space Preconditioners for Saddle Point Systems ⋮ Nonmonotonic projected algorithm with both trust region and line search for constrained optimization ⋮ Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests ⋮ A quasi-Newton method for estimating the parameter in a nonlinear hyperbolic system ⋮ Operations research and optimization (ORO) ⋮ An SQP method for general nonlinear programs using only equality constrained subproblems ⋮ On Secant Updates for Use in General Constrained Optimization ⋮ A reduced Hessian method for constrained optimization ⋮ Orthogonal and conjugate basis methods for solving equality constrained minimization problems ⋮ A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization ⋮ Equality and inequality constrained optimization algorithms with convergent stepsizes ⋮ Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
This page was built for publication: On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem