An accelerated minimal gradient method with momentum for strictly convex quadratic optimization

BIT Numerical Mathematics - In this article we address the problem of minimizing a strictly convex quadratic function using a novel iterative method. The new algorithm is based on the well-known...     

Density functionals for exchange and correlation energies: Exact conditions and comparison of approximations

A set of exact conditions is compiled for the purpose of developing and testing approximations for the exchange-correlation energy as a functional of the electron density. Special emphasis is placed upon recently developed density-scaling relationships. Commonly used generalized gradient approximations are compared against several of these conditions. A direct tabular comparison of these functionals (not of calculated properties) with one another is also made. © 1994 John Wiley & Sons, Inc.     

Self-Interactions of Strands and Sheets

Physical strands or sheets that can be modelled as curves or surfaces embedded in three dimensions are ubiquitous in nature, and are of fundamental importance in mathematics, physics, biology, and engineering. Often the physical interpretation dictates that self-avoidance should be enforced in the continuum model, i.e., finite energy configurations should not self-intersect. Current continuum models with self-avoidance frequently employ pairwise repulsive potentials, which are of necessity singular. Moreover the potentials do not have an intrinsic length scale appropriate for modelling the finite thickness of the physical systems. Here we develop a framework for modelling self-avoiding strands and sheets which avoids singularities, and which provides a way to introduce a thickness length scale. In our approach pairwise interaction potentials are replaced by many-body potentials involving three or more points, and the radii of certain associated circles or spheres. Self-interaction energies based on these many-body potentials can be used to describe the statistical mechanics of self-interacting strands and sheets of finite thickness.     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

The solvable radical of Sylow factorizable groups

Let G be a finite group. A complete Sylow product of G is a product of Sylow subgroups of G, one for each prime divisor of |G|. We shall call G a Sylow factorizable group if it is equal to at least one of its complete Sylow products. We prove that if G is a Sylow factorizable group then the intersection of all complete Sylow products of G is equal to the solvable radical of G. We generalize the concepts and the result to Sylow products which involve an arbitrary subset of the prime divisors of |G|. Received: 26 January 2005     

Letter: Models of Relativistic Particle with Curvature and Torsion Revisited

Models, describing relativistic particles, where Lagrangian densities depend linearly on both the curvature and the torsion of the trajectories, are revisited in D=3 space forms. The moduli spaces of trajectories are completely and explicitly determined using the Lancret program. The moduli subspaces of closed solitons in the three sphere are also determined.     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.