We prove local well posedness in regular spaces and a Beale-Kato-Majda blow-up criterion for a recently derived stochastic model of the 3D Euler fluid equation for incompressible flow. This model describes incompressible fluid motions whose Lagrangian particle paths follow a stochastic process with cylindrical noise and also satisfy Newton’s 2nd Law in every Lagrangian domain.

Convex games are a natural generalization of matrix (normal-form) games that can compactly model many strategic interactions with interesting structure. We present a new anytime algorithm for such games that leverages fast best-response oracles for both players to build a model of the overall game. This model is used to identify search directions; the algorithm then does an exact minimization i...

We consider 3D object retrieval in which a polygonal mesh serves as a query and similar objects are retrieved from a collection of 3D objects. Algorithms proceed first by a normalization step in which models are transformed into canonical coordinates. Second, feature vectors are extracted and compared with those derived from normalized models in the search space. In the feature vector space nea...

Abstract. We present a line search multigrid method for solving discretized versions of general unconstrained infinite dimensional optimization problems. At each iteration on each level, the algorithm computes either a “direct search” direction on the current level or a “recursive search” direction from coarser level models. Introducing a new condition that must be satisfied by a backtracking l...

The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem raised for instance by urban waste collection. In addition to the total route length (the only criterion minimized in the academic problem), waste management companies seek to minimize also the length of the longest trip. A bi-objective genetic algorithm is presented for this more realistic CARP, never studied bef...

The story of Gomory cuts is characterized by swings between great acclaim in the early days, near oblivion for decades and an amazing come back in the last 20 years. These cuts have been described as “elegant”, “disappointing” and “the clear winner” at various times over the last 55 years. This essay retraces that roller coaster. Ralph Gomory’s paper “Early Integer Programming” recounts his dis...

Arc-consistency algorithms are widely used to prune the search space of Constraint Satisfaction Problems (CSPs). One of the most well-known arc-consistency algorithms for filtering CSPs is AC3. This algorithm repeatedly carries out revisions and requires support checks for identifying and deleting all unsupported values from the domains. Nevertheless, many revisions are ineffective, that is, th...

We present a new asynchronous parallel pattern search (APPS) method which is different from that developed previously by Hough, Kolda, and Torczon. APPS efficiently uses parallel and distributed computing platforms to solve science and engineering design optimization problems where derivatives are unavailable and cannot be approximated. The original APPS was designed to be fault-tolerant as wel...