Results 261 to 270 of about 495,604 (291)
Some of the next articles are maybe not open access.
Mathematical Programming, 2016
Optimization problems with cardinality constraints are problems with inequality and equality constraints where additionally the number of nonzero components of the solution is bounded. These problems can equivalently be formulated as mixed-integer optimization problems.
Michal Cervinka +2 more
openaire +3 more sources
Optimization problems with cardinality constraints are problems with inequality and equality constraints where additionally the number of nonzero components of the solution is bounded. These problems can equivalently be formulated as mixed-integer optimization problems.
Michal Cervinka +2 more
openaire +3 more sources
On constraint qualifications in nonlinear programming
Naval Research Logistics Quarterly, 1970In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above.
openaire +1 more source
A constraint qualification for convex programming
Acta Mathematicae Applicatae Sinica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A new constraint qualification condition
Journal of Optimization Theory and Applications, 1986We 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.
openaire +1 more source
A constraint qualification in quasidifferentiable programming
Optimization, 1991One goal in quasid if Terentiable optimization is the development of optimality conditions whose hypotheses are independent of the particular choice of quasidifferentials. One such hypothesis, introduced by Demyanov and Rubinov, involves the concept of a pair of convex sets being “in a general position”.
openaire +1 more source