On the global stabilization of locally convergent algorithms

DOI10.1016/0005-1098(76)90053-4zbMath0335.49023OpenAlexW2054794991MaRDI QIDQ1229433

K. Appert

Publication date: 1976

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(76)90053-4

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Newton-type methods (49M15)

Related Items (25)

Nonmonotone stabilization methods for nonlinear equations ⋮ A new result in the theory and computation of the least-norm solution of a linear program ⋮ New results on a class of exact augmented Lagrangians ⋮ Smooth transformation of the generalized minimax problem ⋮ An exact penalty function method with global convergence properties for nonlinear programming problems ⋮ A globally convergent algorithm for exact penalty functions ⋮ A finite algorithm for the least two-norm solution of a linear program¹ ⋮ Exact penalty algorithm for optimal control problems with control and terminal constraints ⋮ A recursive quadratic programming algorithm for semi-infinite optimization problems ⋮ Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment ⋮ A multiplier method with automatic limitation of penalty growth ⋮ On the finite element solution of frictionless contact problems using an exact penalty approach ⋮ A second-order method for the general nonlinear programming problem ⋮ A second-order method for unconstrained optimization ⋮ Preface ⋮ A new computational algorithm for functional inequality constrained optimization problems ⋮ A first order, exact penalty function algorithm for equality constrained optimization problems ⋮ An exact penalty function algorithm for optimal control problems with control and terminal equality constraints. I ⋮ A method of centers algorithm for certain minimax problems ⋮ A quadratically convergent algorithm for solving infinite dimensional inequalities ⋮ Dual active sets and constrained optimization ⋮ A nonmonotone hybrid method for nonlinear systems^∗ ⋮ Algorithms for optimization problems with exclusion constraints ⋮ On a class fo hybrid methods for smooth constrained optimization ⋮ Analysis and implementation of a dual algorithm for constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplier and gradient methods
• On Newton-like iteration functions: General convergence theorems and a specific algorithm
• Newton's method for the solution of systems of equalities and inequalities
• Extension of Newton's method to nonlinear functions with values in a cone
• A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
• Quasi-Newton Methods and their Application to Function Minimisation
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations

This page was built for publication: On the global stabilization of locally convergent algorithms