The molecular conformation problem is discussed, and a concave quadratic global minimization approach for solving it is described. This approach is based on a quadratic assignment formulation of a discrete approximation to the original problem.

We introduce a ‘‘structure minimization’’ technique to resolve the azimuthal ambiguity of 180 , intrinsic in solar vector magnetic field measurements. We resolve the 180 ambiguity by minimizing the inhomogeneities of the magnetic field strength perpendicular to the magnetic field vector. This relates to a minimization of the sheath currents that envelope the solar magnetic flux tubes, thus allo...

The class of similarity based methods (SBM) covers most neural models and many other classifiers. Performance of such methods is significantly improved if irrelevant features are removed and feature weights introduced, scaling their influence on calculation of similarity. Several methods for feature selection and weighting are described. As an alternative to the global minimization procedures c...

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.

We present a mechanism to avoid congestion in complex networks based on a local knowledge of traffic conditions and the ability of routers to self-coordinate their dynamical behavior. In particular, routers make use of local information about traffic conditions to either reject or accept information packets from their neighbors. We show that when nodes are only aware of their own congestion sta...

In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of the planar-graph shortest path problem.

A novel method is presented for automatically generating quadrilateral meshes on arbitrary two-dimensional domains. Global minimization of a potential function governs mesh formation and characteristics. Comprised of several terms, the potential function distributes the elements throughout the domain and aligns the edges of the elements to form valid connectivities. If there are any remaining u...

Assume that A and B are non-void subsets of a metric space, and that S : A −→ B and T : A −→ B are given non-self mappings. In light of the fact that S and T are non-self mappings, it may happen that the equations Sx = x and Tx = x have no common solution, named a common fixed point of the mappings S and T . Subsequently, in the event that there is no common solution of the preceding equations,...

A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.

In this paper we consider the nonconvex minimization problem of the value at risk VaR that arises from nancial risk analysis By considering this problem as a special linear program with linear complementarity constraints a bilevel linear program to be more precise we develop upper and lower bounds for the minimumVaR and show how the combined bounding procedures can be used to compute the latter...