Global and local convergence of a penalty-free method for nonlinear programming
type: Item
instance of: scholarly article
title: Global and local convergence of a penalty-free method for nonlinear programming
zbMATH Open document ID: 1319.90064
author: Zhongwen Chen
author: Songqiang Qiu
publication date: 2015-09-03T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6478282
zbMATH Keywords: nonlinear programming
zbMATH Keywords: penalty-free algorithm
zbMATH Keywords: feasibility safeguard method
zbMATH Keywords: global convergence
zbMATH Keywords: local convergence
MaRDI profile type: Publication
full work available at URL: j.camwa.2012.10.012
OpenAlex ID: W2005400096
DOI: 10.1016/J.CAMWA.2012.10.012
published in: Computers & Mathematics with Applications
Recommended article: Global and local convergence of a class of penalty-free-type methods for nonlinear programming
Recommended article: An exact penalty function method with global convergence properties for nonlinear programming problems
Recommended article: Q4836280
Recommended article: Global convergence of a nonlinear programming method using convex approximations
Recommended article: On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
Recommended article: Q4729626
Recommended article: From global to local convergence of interior methods for nonlinear optimization
Recommended article: Global convergence of a class of smooth penalty methods for semi-infinite programming
Recommended article: A globally convergent penalty-free method for optimization with equality constraints and simple bounds
Recommended article: On the Local Convergence of a Penalty-Function-Free SQP Method
description: scientific article; zbMATH DE number 6478282