A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
type: Item
instance of: scholarly article
title: A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
zbMATH Open document ID: 1058.90077
published in: Applied Mathematics and Computation
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 2137737
zbMATH Keywords: Nonlinear inequality
zbMATH Keywords: Constrained optimization
zbMATH Keywords: SQP
zbMATH Keywords: Generalized projection
zbMATH Keywords: Feasible descent algorithm
zbMATH Keywords: Superlinear convergence
zbMATH Keywords: Sequential quadratic programming
zbMATH Keywords: Projection method
zbMATH Keywords: Nonlinear programming
author: Jinbao Jian
MaRDI profile type: Publication
full work available at URL: j.amc.2004.01.016
OpenAlex ID: W1990383971
cites work: A globally convergent method for nonlinear programming
cites work: Q4151662
cites work: A surperlinearly convergent algorithm for constrained optimization problems
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: A recursive quadratic programming algorithm that uses differentiable exact penalty functions
cites work: Q4367379
cites work: Q4338261
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
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: Q4897149
cites work: Q4391955
cites work: Q4879594
cites work: Q4702075
cites work: A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
cites work: Q4884524
cites work: A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
cites work: Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence
cites work: Sequential Quadratic Programming with Penalization of the Displacement
cites work: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
DOI: 10.1016/J.AMC.2004.01.016
description: scientific article; zbMATH DE number 2137737