we study the support sets of sub-topical functions‎ ‎and investigate their maximal elements in order to establish a necessary and sufficient condition‎ ‎for the global minimum of the difference of two sub-topical functions‎.

This paper considers the problem of constructing the maximum and the minimum consistent global checkpoints that contain a target set of checkpoints, and identify it as a generic issue in recovery-related applications. We formulate the problem as a reachability analysis problem on a directed rollback-dependency graph, and develop efficient algorithms to calculate the two consistent global checkp...

L denotes the classical curve length, s is the arc-length parameter, and Γ : [0, L]→ Ω is a curve with non-vanishing velocity vector. κ is the curvature and α , β are two positively weighted functions computed by the optimally oriented flux filter [2]. Our first step is to cast the elastica energy (5) in the form of path length with respect to a degenerate Finsler metric. For that purpose, let ...

The problem of minimizing the flow value attained by maximal flows plays an important and interesting role to investigate how inefficiently a network can be utilized. It is a typical multiextremal optimization problem, which can have local optima different from global optima. We formulate this problem as an global optimization problem with a special structure and propose a method to combine dif...

The main goal of this paper is to prove some new results and extend some earlier ones about functions, which possess the so called local-global minimum property. In the last section, we show an application of these in the theory of calculus of variations.

The ant colony optimization (ACO) algorithms are multi-agent systems in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem. This paper presents the ACO based algorithm to find global minimum. Algorithm is based on that each ant searches only around the best solution of the previous iteration. This algorithm was experimented on test p...

The BB algorithm is a deterministically based global optimization method that has been successfully used to locate the global minimum energy conformations of peptide systems. The goal of this procedure is to identify the native conformation of a given peptide by identifying the structure possessing the global minimum potential energy. However, a rigorous conformational search should locate the ...