Related Experiment Video
Updated: Mar 2, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
An SQP method for mathematical programs with vanishing constraints with strong convergence properties
1Institute of Computational Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria.
Abstract:
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of [Formula: see text]-stationarity (Benko and Gfrerer in Optimization 66(1):61-92, 2017). We demonstrate how [Formula: see text]-stationary solutions of the quadratic program can be obtained. We show that all limit points of the sequence of iterates generated by the basic SQP method are at least M-stationary and by some extension of the method we also guarantee the stronger property of [Formula: see text]-stationarity of the limit points.
Related Concept Videos
Application of Nonlinear Inequalities
Gaussian Elimination: Problem Solving
The Squeeze Theorem
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...
Constraints and Statical Determinacy
Statically Indeterminate Problem Solving