A globally and quadratically convergent algorithm for general nonlinear programming problems
type: Item
instance of: scholarly article
title: A globally and quadratically convergent algorithm for general nonlinear programming problems
zbMATH Open document ID: 0458.65053
DOI: 10.1007/BF02241780
author: J. Bräuninger
author: Michael J. Best
author: Klaus Ritter
author: Stephen M. Robinson
published in: Computing
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3718476
zbMATH Keywords: Robinson's method
zbMATH Keywords: global convergence
zbMATH Keywords: penalty algorithms
zbMATH Keywords: quadratic convergence
MaRDI profile type: Publication
cites work: A computational comparison of some non-linear programs
cites work: A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
cites work: Q4159192
cites work: Q5630864
cites work: Q5652460
cites work: Penalty function versus non-penalty function methods for constrained nonlinear programming problems
cites work: A superlinearly convergent method for minimization problems with linear inequality constraints
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
full work available at URL: https://doi.org/10.1007/bf02241780
OpenAlex ID: W1589869438
description: scientific article; zbMATH DE number 3718476