Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints

DOI10.1016/J.CAM.2006.05.034MaRDI QIDQ2372939zbMATH OpenOpenAlexFDO

Authors Ran Quan, Jinbao Jian, Xue-Lu Zhang

Publication date 17 July 2007

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2006.05.034

zbMATH Keywords

feasible sqp algorithmgeneralized monotone line searchglobal convergenceinequality constraintsminimax problemssuperlinear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Recommendations

• Generalized monotone line search SQP algorithm for constrained minimax problems
• scientific article; zbMATH DE number 1014538
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
• A feasible equality constrained SQP algorithm for nonlinear optimization
• A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
• Generalised monotone line search algorithm for degenerate nonlinear minimax problems
• An efficient feasible SQP algorithm for inequality constrained optimization
• An SQP method with a revised non-monotone line search
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
• scientific article; zbMATH DE number 5926248

Cites work

• A constrained min-max algorithm for rival models of the same economic system
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A generalization of the norm-relaxed method of feasible directions
• A Nonmonotone Line Search Technique for Newton’s Method
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• scientific article; zbMATH DE number 1802796 (Why is no real title available?)
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3727523 (Why is no real title available?)
• Nonmonotone line search algorithm for constrained minimax problems
• Nonmonotone line search for minimax problems
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers
• Rate of Convergence of a Class of Methods of Feasible Directions

Cited in

(26)

• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
• A globally convergent QP-free algorithm for inequality constrained minimax optimization
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
• scientific article; zbMATH DE number 5926248 (Why is no real title available?)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
• A sequential quadratic programming algorithm with non-monotone line search
• Generalized monotone line search SQP algorithm for constrained minimax problems
• Substitution secant/finite difference method to large sparse minimax problems
• A nonlinear augmented Lagrangian for constrained minimax problems
• A generalized neural network for solving a class of minimax optimization problems with linear constraints
• A modifed feasible SQP method for constrained minimax optimization problems
• A strongly sub-feasible norm-relaxed SQCQP algorithm for the inequality constrained minimax problems
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
• A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
• A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
• A new non-monotone SQP algorithm for the minimax problem
• A sequential quadratic programming algorithm for nonlinear minimax problems
• Generalised monotone line search algorithm for degenerate nonlinear minimax problems
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
• An interior-point trust-region algorithm to solve a finite nonlinear minimax problem
• A modified SQP algorithm for minimax problems
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence

This page was built for publication: Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372939)