A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
From MaRDI portal
Publication:505808
DOI10.1016/j.amc.2013.10.082zbMath1354.90169OpenAlexW2166278679MaRDI QIDQ505808
Jin-Bao Jian, Jie Li, Hai-Yan Zheng, Jian-Ling Li
Publication date: 26 January 2017
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.10.082
global and superlinear convergencesystem of linear equationsconstrained minimax problemsmethod of quasi-strongly sub-feasible directionsnorm-relaxed SQP method
Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Unnamed Item
- Unnamed Item
- On the accurate identification of active set for constrained minimax problems
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- 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
- A new SQP method of feasible directions for nonlinear programming.
- Nonmonotone line search algorithm for constrained minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- Generalized monotone line search SQP algorithm for constrained minimax problems
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems
- A superlinearly convergent method of feasible directions.
- Smoothing method for minimax problems
