where An is the n-fold product of the σ-algebra A of subsets of a given set X , Fi, Gi, i∈ p ≡ {1,2, . . . , p}, and Hj , j ∈ q, are real-valued functions defined on An, and for each i∈ p, Gi(S) > 0 for all S∈An such that Hj(S) ≤ 0, j ∈ q. Optimization problems of this type in which the functions Fi, Gi, i∈ p, and Hj , j ∈ q, are defined on a subset of Rn (n-dimensional Euclidean space) are cal...

Even for sufficiently simple single-input control-affine systems without state constraints the subject of analytical and qualitative investigation of global optimal control synthesis is developed rather poorly in the literature on optimal control theory and its applications. The aim of this work is to present numerical-analytical and qualitative methods to construct global optimal control synth...

Difference-of-Convex (DC) minimization, referring to the problem of minimizing difference two convex functions, has been found rich applications in statistical learning and studied extensively for decades. However, existing methods are primarily based on multi-stage relaxation, only leading weak optimality critical points. This paper proposes a coordinate descent method class DC functions seque...

In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized conve...

We first establish sufficient conditions ensuring strong duality for cone constrained nonconvex optimization problems under a generalized Slater-type condition. Such conditions allow us to cover situations where recent results cannot be applied. Afterwards, we provide a new complete characterization of strong duality for a problem with a single constraint: showing, in particular, that strong du...

We study a multiobjective variational problem on time scales. For this problem, necessary and sufficient conditions for weak local Pareto optimality are given. We also prove a necessary optimality condition for the isoperimetric problem with multiple constraints on time scales.

preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...