A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
type: Item
instance of: scholarly article
title: A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
zbMATH Open document ID: 0988.90051
author: Shengjia Xue
author: Jinbao Jian
author: Kecun Zhang
published in: Applied Mathematics. Series B (English Edition)
publication date: 2002-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1542574
zbMATH Keywords: constrained optimization
zbMATH Keywords: SQP
zbMATH Keywords: feasible method
zbMATH Keywords: convergence
zbMATH Keywords: rate of convergence
MaRDI profile type: Publication
full work available at URL: s11766-000-0057-9
OpenAlex ID: W2320608532
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: Q4879594
cites work: Q4884524
cites work: Q4950903
cites work: Q3915937
cites work: Q4382879
cites work: Q4867545
cites work: New Results on a Continuously Differentiable Exact Penalty Function
cites work: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
DOI: 10.1007/S11766-000-0057-9
description: scientific article; zbMATH DE number 1542574