Equality and inequality constrained optimization algorithms with convergent stepsizes
type: Item
instance of: scholarly article
title: Equality and inequality constrained optimization algorithms with convergent stepsizes
zbMATH Open document ID: 0797.90097
DOI: 10.1007/BF00939376
author: Berç Rustem
published in: Journal of Optimization Theory and Applications
publication date: 1994-10-27T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 557803
zbMATH Keywords: sequential quadratic programming
zbMATH Keywords: nonlinear equality and inequality constraints
zbMATH Keywords: augmented Lagrangians
zbMATH Keywords: adaptive penalty parameter
zbMATH Keywords: convergence analysis
zbMATH Keywords: constrained optimization
zbMATH Keywords: global convergence
MaRDI profile type: Publication
cites work: A globally convergent, implementable multiplier method with automatic penalty limitation
cites work: On Secant Updates for Use in General Constrained Optimization
cites work: Q5684177
cites work: A globally convergent method for nonlinear programming
cites work: A recursive quadratic programming algorithm that uses differentiable exact penalty functions
cites work: Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
cites work: Experiments with successive quadratic programming algorithms
cites work: On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
cites work: Recursive quadratic programming methods based on the augmented lagrangian
cites work: A Globally Convergent Version of REQP for Constrained Minimization
cites work: Convergent stepsizes for constrained optimization algorithms
cites work: A surperlinearly convergent algorithm for constrained optimization problems
cites work: A robust secant method for optimization problems with inequality constraints
cites work: Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
cites work: The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
cites work: The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
cites work: On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
cites work: Q4323608
cites work: A robust sequential quadratic programming method
cites work: On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
cites work: On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
cites work: A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
cites work: Some examples of cycling in variable metric methods for constrained minimization
cites work: The watchdog technique for forcing convergence in algorithms for constrained optimization
cites work: Q4014194
cites work: Nonlinear programming via an exact penalty function: Asymptotic analysis
cites work: Q3690580
cites work: Exact Penalty Functions in Constrained Optimization
cites work: Q3952718
cites work: A class of superlinearly convergent projection algorithms with relaxed stepsizes
cites work: Test examples for nonlinear programming codes
full work available at URL: https://doi.org/10.1007/bf00939376
OpenAlex ID: W2006750587
description: scientific article; zbMATH DE number 557803