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

DOI10.1016/j.cam.2006.05.034zbMath1149.90148OpenAlexW2071842584MaRDI QIDQ2372939

Ran Quan, Xue-Lu Zhang, Jin-Bao Jian

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

global convergenceminimax problemssuperlinear convergenceinequality constraintsfeasible sqp algorithmgeneralized monotone line search

Mathematics Subject Classification ID

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

Related Items (15)

A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ 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 ⋮ An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ 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

Cites Work

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

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