Optimality Conditions for Group Sparse Constrained Optimization Problems
In this paper, optimality conditions for the group sparse constrained optimization (GSCO) problems are studied. Firstly, the equivalent characterizations of Bouligand tangent cone, Clarke tangent cone and their corresponding normal cones of the group ...
Wenying Wu, Dingtao Peng
doaj +1 more source
KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization [PDF]
For a long time, the bilevel programming problem has essentially been considered as a special case of mathematical programs with equilibrium constraints (MPECs), in particular when the so-called KKT reformulation is in question.
Zemkoho, Alain B., Dempe, Stephan
core +1 more source
Optimality Conditions in Nondifferentiable G-Invex Multiobjective Programming
We consider a class of nondifferentiable multiobjective programs with inequality and equality constraints in which each component of the objective function contains a term involving the support function of a compact convex set.
Kim HoJung, Seo YouYoung, Kim DoSang
doaj +2 more sources
ON NECESSARY OPTIMALITY CONDITIONS FOR RAMSEY-TYPE PROBLEMS
We study an optimal control problem in infinite time, where the integrand does not depend explicitly on the state variable. A special case of such problem is the Ramsey optimal capital accumulation in centralized economy.
Anton O. Belyakov
doaj +1 more source
Optimality conditions for distributive justice [PDF]
AbstractThis paper uses optimization theory to address a fundamental question of ethics: how to divide resources justly among individuals, groups, or organizations. It formulates utilitarian and Rawlsian criteria for distributive justice as optimization problems.
openaire +3 more sources
Necessary and sufficient condition on global optimality without convexity and second order differentiability [PDF]
The main goal of this paper is to give a necessary and sufficient condition of global optimality for unconstrained optimization problems, when the objective function is not necessarily convex. We use Gâteaux differentiability of the objective function
Burai, Pál
core +1 more source
Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems
One of the most important optimality conditions to aid in solving a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition.
W. A. Oliveira +3 more
doaj +1 more source
Optimality and duality for a class of nondifferentiable minimax fractional programming problems [PDF]
Necessary and sufficient optimality conditions are established for a class of nondifferentiable minimax fractional programming problems with square root terms. Subsequently, we apply the optimality conditions to formulate a parametric dual problem and we
Bătătorescu Antoan +3 more
doaj +1 more source
Mordukhovich Normal Cone of Optimization Problems with Switching Constraints [PDF]
This paper examines normal cones of the feasible set for mathematical programming problems with switching constraints (MPSC). Functions involved are assumed to be continuously differentiable.
Sharifeh Rezagholi +1 more
doaj +1 more source
In this paper, we study the optimality conditions for set optimization problems with set criterion. Firstly, we establish a few important properties of the Minkowski difference for sets.
Yuhe Zhang, Qilin Wang
doaj +1 more source

