Implicit optimality criterion for convex SIP problem with box constrained index set
نویسندگان
چکیده
منابع مشابه
The KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملA constrained independent set problem for matroids
In this note, we study a constrained independent set problem for matroids and certain generalizations. The basic problem can be regarded as an ordered version of the matroid parity problem. By a reduction of this problem to matroid intersection, we prove a min-max formula. Studying the weighted case and a delta-matroid generalization, we prove that some of them are not more complex than matroid...
متن کاملSolutions and Optimality Criteria to Box Constrained Nonconvex Minimization Problems
This paper presents a canonical duality theory for solving nonconvex polynomial programming problems subjected to box constraints. It is proved that under certain conditions, the constrained nonconvex problems can be converted to the so-called canonical (perfect) dual problems, which can be solved by deterministic methods. Both global and local extrema of the primal problems can be identified b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2011
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-011-0189-5