We present an open global minimization problem: it concerns the minimization of the volume among the compact convex sets in R3 of a given constant thickness.

Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brou...

The present work is concerned with the development of a new algorithm for determination of the equilibrium composition of gaseous detonations. The elements balance equations, and the second law of thermodynamics (i.e., the minimization of the Gibbs free energy of products), are used to determine the equilibrium composition of the detonation products. To minimize the Gibbs free energy with tradi...

We examine various methods for data clustering and data classification that are based on the minimization of the so-called cluster function and its modifications. These functions are nonsmooth and nonconvex. We use Discrete Gradient methods for their local minimization. We consider also a combination of this method with the cutting angle method for global minimization. We present and discuss re...

Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...