Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
468
CONSTRAINT QUALIFICATIONS
- ENCYCLOPEDIA OF OPERATIONS RESEARCH AND MANAGEMENT SCIENCE
"... We discuss assumptions on the constraint functions that allow constructive description of the geometry of a given set around a given point in terms of the constraints derivatives. Consequences for characterizing solutions of variational and optimization problems are discussed. In the optimization ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
We discuss assumptions on the constraint functions that allow constructive description of the geometry of a given set around a given point in terms of the constraints derivatives. Consequences for characterizing solutions of variational and optimization problems are discussed. In the optimization
Constraint Qualification Failure in Action
"... Abstract This note presents a theoretical analysis of disjunctive constraints featuring unbounded variables. In this framework, classical modeling techniques, including big-M approaches, are not applicable. We introduce a lifted second-order cone formulation of such on/off constraints and discuss r ..."
Abstract
- Add to MetaCart
related constraint qualification issues. A solution is proposed to avoid solvers' failure.
On Constraint Qualifications with Generalized Convexity and Optimality Conditions
, 2005
"... On constraint qualifications with generalized convexity and optimality conditions ..."
Abstract
- Add to MetaCart
On constraint qualifications with generalized convexity and optimality conditions
On constraint qualifications in directionally differentiable multiobjective optimization
- RES
, 2004
"... We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given
DUALITY WITHOUT CONSTRAINT QUALIFICATION IN NONSMOOTH OPTIMIZATION
, 2006
"... We are concerned with a nonsmooth multiobjective optimization problem with inequal-ity constraints. In order to obtain our main results, we give the definitions of the gener-alized convex functions based on the generalized directional derivative. Under the above generalized convexity assumptions, su ..."
Abstract
- Add to MetaCart
, sufficient and necessary conditions for optimality are given without the need of a constraint qualification. Then we formulate the dual problem corresponding to the primal problem, and some duality results are obtained without a constraint qualification. Copyright © 2006 Hindawi Publishing Corporation. All
Two new weak constraint qualifications and applications
"... We present two new constraint qualifications (CQ) that are weaker than the recently introduced Relaxed Constant Positive Linear Dependence (RCPLD) constraint qualification. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependen ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
We present two new constraint qualifications (CQ) that are weaker than the recently introduced Relaxed Constant Positive Linear Dependence (RCPLD) constraint qualification. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear
Presolving for Semidefinite Programs Without Constraint Qualifications
, 1998
"... Presolving for linear programming is an essential ingredient in many commercial packages. This step eliminates redundant constraints and identically zero variables, and it identifies possible infeasibility and unboundedness. In semidefinite programming, identically zero variables corresponds to lack ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
to lack of a constraint qualification which can result in both theoretical and numerical difficulties. A nonzero duality gap can exist which nullifies the elegant and powerful duality theory. Small perturbations can result in infeasibility and/or large perturbations in solutions. Such problems fall
Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification, Kybernetika
, 2013
"... Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
GEOMETRY OF OPTIMALITY CONDITIONS AND CONSTRAINT QUALIFICATIONS: THE CONVEX CASE
, 1980
"... The cones of directions of constancy are used to derive: new as well as known optimality conditions; weakest constraint qualifications; and regularization techniques, for the convex programming problem. In addition, the "badly behaved set" of constraints, i.e. the set of constraints which ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
The cones of directions of constancy are used to derive: new as well as known optimality conditions; weakest constraint qualifications; and regularization techniques, for the convex programming problem. In addition, the "badly behaved set" of constraints, i.e. the set of constraints which
Results 1 - 10
of
468
