zbMATH — the first resource for mathematics

Two new weak constraint qualifications and applications. (English) Zbl 1302.90244
The paper proposes two constraint qualifications: constant rank of the subspace component and constant positive generator. They are aimed to be weaker than the relaxed constant positive linear dependence constraint qualification. Besides analyzing the new constraint qualifications, their relations to other constraint qualifications are discussed. Furthermore, applications of the new constraint qualifications as error bounds and in ensuring global convergence of several nonlinear optimization algorithms are considered.

90C46 Optimality conditions and duality in mathematical programming
90C30 Nonlinear programming
Full Text: DOI