Global minimizers for the Ginzburg-Landau functional below the first critical magnetic field
Global minimizing domains for the first eigenvalue of an elliptic operator with non-constant coefficients.
Global optimality conditions for a dynamic blocking problem
The paper is concerned with a class of optimal blocking problems in the plane. We consider a time dependent set R(t) ⊂ ℝ2, described as the reachable set for a differential inclusion. To restrict its growth, a barrier Γ can be constructed, in real time. This is a one-dimensional rectifiable set which blocks the trajectories of the differential inclusion. In this paper we introduce a definition of “regular strategy”, based on a careful classification of blocking arcs. Moreover, we derive local and...
Global optimality conditions for a dynamic blocking problem
The paper is concerned with a class of optimal blocking problems in the plane. We consider a time dependent set R(t) ⊂ ℝ2, described as the reachable set for a differential inclusion. To restrict its growth, a barrier Γ can be constructed, in real time. This is a one-dimensional rectifiable set which blocks the trajectories of the differential inclusion. In this paper we introduce a definition of “regular strategy”, based on a careful classification...
Global regularity for solutions of the minimal surface equation with continuous boundary values
Global regularity of the solutions to the capillarity problem
Global solution of optimal shape design problems.
Global stability, periodic solutions, and optimal control in a nonlinear differential delay model.
Global subanalytic solutions of Hamilton–Jacobi type equations
Globalization of SQP-methods in control of the instationary Navier-Stokes equations
A numerically inexpensive globalization strategy of sequential quadratic programming methods (SQP-methods) for control of the instationary Navier Stokes equations is investigated. Based on the proper functional analytic setting a convergence analysis for the globalized method is given. It is argued that the a priori formidable SQP-step can be decomposed into linear primal and linear adjoint systems, which is amenable for existing CFL-software. A report on a numerical test demonstrates the feasibility...
Globalization of SQP-Methods in Control of the Instationary Navier-Stokes Equations
A numerically inexpensive globalization strategy of sequential quadratic programming methods (SQP-methods) for control of the instationary Navier Stokes equations is investigated. Based on the proper functional analytic setting a convergence analysis for the globalized method is given. It is argued that the a priori formidable SQP-step can be decomposed into linear primal and linear adjoint systems, which is amenable for existing CFL-software. A report on a numerical test demonstrates the feasibility...
Global-Local subadditive ergodic theorems and application to homogenization in elasticity
Gradient estimates and Harnack inequalities for solutions to the minimal surface equation
A gradient estimate for solutions to the minimal surface equation can be proved by Partial Differential Equations methods, as in [2]. In such a case, the oscillation of the solution controls its gradient. In the article presented here, the estimate is derived from the Harnack type inequality established in [1]. In our case, the gradient is controlled by the area of the graph of the solution or by the integral of it. These new results are similar to the one announced by Ennio De Giorgi in [3].
Gradient estimation of a -harmonic map.
Gradient flow for the one-dimensional Mumford-Shah functional
Gradient flows in Wasserstein spaces and applications to crowd movement
Starting from a motivation in the modeling of crowd movement, the paper presents the topics of gradient flows, first in , then in metric spaces, and finally in the space of probability measures endowed with the Wasserstein distance (induced by the quadratic transport cost). Differently from the usual theory by Jordan-Kinderlehrer-Otto and Ambrosio-Gigli-Savaré, we propose an approach where the optimality conditions for the minimizers of the optimization problems that one solves at every time step...
Gradient flows in Wasserstein spaces and applications to crowd movement
Starting from a motivation in the modeling of crowd movement, the paper presents the topics of gradient flows, first in , then in metric spaces, and finally in the space of probability measures endowed with the Wasserstein distance (induced by the quadratic transport cost). Differently from the usual theory by Jordan-Kinderlehrer-Otto and Ambrosio-Gigli-Savaré, we propose an approach where the optimality conditions for the minimizers of the optimization problems that one solves at every time step...
Gradient flows of the entropy for jump processes
We introduce a new transport distance between probability measures on that is built from a Lévy jump kernel. It is defined via a non-local variant of the Benamou–Brenier formula. We study geometric and topological properties of this distance, in particular we prove existence of geodesics. For translation invariant jump kernels we identify the semigroup generated by the associated non-local operator as the gradient flow of the relative entropy w.r.t. the new distance and show that the entropy is...
Gradient method for finding optimal scheduling in infinite dimensional models of chemotherapy.
Gradient method with dynamical retards for large-scale optimization problems.