Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
type: Item
instance of: scholarly article
title: Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
zbMATH Open document ID: 0418.65028
DOI: 10.1007/BF00934840
published in: Journal of Optimization Theory and Applications
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 3651663
zbMATH Keywords: nonlinearly constrained minimization problems
zbMATH Keywords: quadratic programming
zbMATH Keywords: nonlinear programming
zbMATH Keywords: global convergence
zbMATH Keywords: numerical experience
author: Ian D. Coope
author: Roger Fletcher
MaRDI profile type: Publication
cites work: Multiplier and gradient methods
cites work: Q5590418
cites work: An Ideal Penalty Function for Constrained Optimization
cites work: Q4070637
cites work: A globally convergent method for nonlinear programming
cites work: Q4151662
cites work: Some examples of cycling in variable metric methods for constrained minimization
cites work: Quadratic termination properties of Davidon's new variable metric algorithm
cites work: Q4163968
cites work: Combined Primal–Dual and Penalty Methods for Convex Programming
cites work: Multiplier methods: A survey
cites work: Q4107408
cites work: On the Local and Superlinear Convergence of Quasi-Newton Methods
cites work: Dual Variable Metric Algorithms for Constrained Optimization
cites work: Q5630864
cites work: Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
cites work: A set of geometric programming test problems and their solutions
full work available at URL: https://doi.org/10.1007/bf00934840
OpenAlex ID: W2052204734
description: scientific article; zbMATH DE number 3651663