A new norm-relaxed SQP algorithm with global convergence
type: Item
instance of: scholarly article
title: A new norm-relaxed SQP algorithm with global convergence
zbMATH Open document ID: 1186.90088
author: Haiyan Zheng
author: Jinbao Jian
author: Chun-Ming Tang
author: Ran Quan
published in: Applied Mathematics Letters
publication date: 2010-05-21T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5710910
zbMATH Keywords: norm-relaxed SQP
zbMATH Keywords: \(l_\infty \) penalty function
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: j.aml.2010.02.005
OpenAlex ID: W2076636122
cites work: Q4151662
cites work: Norm-relaxed method of feasible directions for solving nonlinear programming problems
cites work: A generalization of the norm-relaxed method of feasible directions
cites work: A computationally efficient feasible sequential quadratic programming algorithm
cites work: A new SQP method of feasible directions for nonlinear programming.
cites work: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
cites work: A variant of SQP method for inequality constrained optimization and its global convergence
cites work: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
DOI: 10.1016/J.AML.2010.02.005
description: scientific article; zbMATH DE number 5710910