Related Experiment Video
Updated: May 1, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
A simple SQP algorithm for constrained finite minimax problems
1The Department of Information Science and Engineering, Hunan University of Humanities, Science and Technology, Loudi 417000, China.
Abstract:
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming. By solving a corresponding quadratic programming, a high-order revised direction is obtained, which can avoid the Maratos effect. Furthermore, under some mild conditions, the global and superlinear convergence of the algorithm is achieved. Finally, some numerical results reported show that the algorithm in this paper is successful.
More Related Videos
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimization Problems
Gaussian Elimination: Problem Solving
Statically Indeterminate Problem Solving
Quadratic Equations
Application of Nonlinear Inequalities

