An efficient sequential quadratic programming algorithm for nonlinear programming
type: Item
instance of: scholarly article
title: An efficient sequential quadratic programming algorithm for nonlinear programming
zbMATH Open document ID: 1058.90078
published in: Journal of Computational and Applied Mathematics
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 2137464
zbMATH Keywords: Inequality constrained optimization
zbMATH Keywords: Method of feasible direction
zbMATH Keywords: SQP algorithm
zbMATH Keywords: Global convergence
zbMATH Keywords: Superlinear convergence rate
zbMATH Keywords: Sequential quadratic programming
zbMATH Keywords: Feasible directions
author: Zhibin Zhu
MaRDI profile type: Publication
full work available at URL: j.cam.2004.07.001
OpenAlex ID: W2004199889
cites work: Q3932576
cites work: A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
cites work: Q4840764
cites work: A generalization of the norm-relaxed method of feasible directions
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: Test examples for nonlinear programming codes
cites work: A superlinearly convergent method of feasible directions.
cites work: A computationally efficient feasible sequential quadratic programming algorithm
cites work: A surperlinearly convergent algorithm for constrained optimization problems
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: On the rate of convergence of certain methods of centers
cites work: Q4151662
cites work: A recursive quadratic programming algorithm that uses differentiable exact penalty functions
cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
cites work: Q3277015
DOI: 10.1016/J.CAM.2004.07.001
description: scientific article; zbMATH DE number 2137464