A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Foundations of Computational Mathematics
We analyze the properties that optimization algorithms must possess in order to prevent convergence to non-stationary points for the merit function. We show that demanding the exact satisfaction of constraint linearizations results in di culties in a wide range of optimization algorithms. Feasibility control is a mechanism that prevents convergence to spurious solutions by ensuring that su cient progress towards feasibility is made, even in the presence of certain rank de ciencies. The conceptdoi:10.1017/cbo9781107360198.007 fatcat:xnco2eqiinhorbkchcsztgyrj4