
doi: 10.1007/bf00940572
We introduce a new constraint qualification condition in mathematical programming which encompasses the Mangasarian-Fromovitz's condition and the constant rank condition of Janin. Contrarily to the Mangasarian- Fromovitz's condition, our condition is still satisfied when one translates equalities as double inequalities. It relies on the fact that linearization stability is easier to check with equalities than with inequalities.
Numerical methods based on nonlinear programming, rank theorem, Nonlinear programming, constraint qualification condition, linearization stability
Numerical methods based on nonlinear programming, rank theorem, Nonlinear programming, constraint qualification condition, linearization stability
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
