1 Russian-Armenian (Slavonic) University, Yerevan, Armenia. 2 Institute of Mathematics Armenian Academy of Sciences, Yerevan, Armenia. The problem of reconstruction of a convex body from the mean and ...

Matrix inequalities and convex functions constitute a central theme in modern mathematical analysis, with far‐reaching implications across numerical analysis, optimisation, quantum information, and ...

Strongly convex functions are always strictly convex, and strictly convex functions are always convex. Convex functions always have convex domains. $F$ is convex if ...

Given x 0 , a point of a convex subset C of a Euclidean space, the two following statements are proven to be equivalent: (i) every convex function f : C → ℝ is upper semi-continuous at x 0 , and (ii) ...

The problem is considered of maximizing a function in a convex region. To solve this problem a new method is developed, to be called "method of feasible directions". It is a method of steep ascent.

We start with the simplest problem: unconstrained convex optimization where the objective function is also differentiable. Suppose we have a convex, differentiable $f ...

This paper presents two different optimization-based trajectory generation methods for multiple aircrafts, i.e., mixed-integer convex programming (MICP) and difference of convex functions (DC) ...

We consider the solution of matching problems with a convex cost function via a network flow algorithm. We review the general mapping between matching problems and flow problems on skew symmetric ...

Abstract: In order to address the economic problem when there are equipment with non-convex cost functions in the collaborative dispatch of integrated energy systems, a method of encapsulating and ...