Generalized monotone line search SQP algorithm for constrained minimax problems
type: Item
instance of: scholarly article
title: Generalized monotone line search SQP algorithm for constrained minimax problems
zbMATH Open document ID: 1158.90404
DOI: 10.1080/02331930801951140
author: Xue-Lu Zhang
author: Ran Quan
author: Qing Ma
author: Jinbao Jian
published in: Optimization
publication date: 2009-04-23T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5546181
zbMATH Keywords: constrained minimax problems
zbMATH Keywords: generalized monotone line search
zbMATH Keywords: SQP algorithm
zbMATH Keywords: global convergence
zbMATH Keywords: superlinear convergence
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/02331930801951140
OpenAlex ID: W2130570561
cites work: Interior Methods for Nonlinear Optimization
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
cites work: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
cites work: A Robust Algorithm for Optimization with General Equality and Inequality Constraints
cites work: A surperlinearly convergent algorithm for constrained optimization problems
cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: More test examples for nonlinear programming codes
cites work: Nonmonotone line search algorithm for constrained minimax problems
cites work: Nonmonotone line search for minimax problems
Recommended article: Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
Recommended article: Q4338261
Recommended article: Generalised monotone line search algorithm for degenerate nonlinear minimax problems
Recommended article: A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
Recommended article: Nonmonotone line search algorithm for constrained minimax problems
Recommended article: Q3516592
Recommended article: A new non-monotone SQP algorithm for the minimax problem
Recommended article: Q3517228
Recommended article: Q5198184
Recommended article: A modified SQP algorithm for minimax problems
description: scientific article