Related Experiment Video
Updated: Mar 6, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
A generalized gradient projection method based on a new working set for minimax optimization problems with inequality
Guodong Ma1, Yufeng Zhang2, Meixing Liu1
1School of Mathematics and Statistics, Guangxi Colleges and Universities Key Laboratory of Complex System Optimization and Big Data Processing, Yulin Normal University, Yulin, China.
Abstract:
Combining the techniques of the working set identification and generalized gradient projection, we present a new generalized gradient projection algorithm for minimax optimization problems with inequality constraints. In this paper, we propose a new optimal identification function, from which we provide a new working set. At each iteration, the improved search direction is generated by only one generalized gradient projection explicit formula, which is simple and could reduce the computational cost. Under some mild assumptions, the algorithm possesses the global and strong convergence. Finally, the numerical results show that the proposed algorithm is promising.
Related Concept Videos
Application of Nonlinear Inequalities
Optimization Problems
Introduction to Nonlinear Inequalities
Graphical Representation of Inequalities
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...
Gaussian Elimination: Problem Solving
