TITLE

# Longtime existence of the Lagrangian mean curvature flow

AUTHOR(S)
Knut Smoczyk
PUB. DATE
May 2004
SOURCE
Calculus of Variations & Partial Differential Equations;May2004, Vol. 20 Issue 1, p25
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
Given a compact Lagrangian submanifold in flat space evolving by its mean curvature, we prove uniform $C^{2,\alpha}$ -bounds in space and C 2-estimates in time for the underlying Monge-Ampï¿½re equation under weak and natural assumptions on the initial Lagrangian submanifold. This implies longtime existence and convergence of the Lagrangian mean curvature flow. In the 2-dimensional case we can relax our assumptions and obtain two independent proofs for the same result.
ACCESSION #
12697798

## Related Articles

• New Language Multipliers Rules for Constrained Quasidifferentiable Optimization. Yan Gao // Vietnam Journal of Mathematics;Mar2002, Vol. 30 Issue 1, p55

New first-order necessary optimality conditions with Lagrange multipliers for quasidifferentiable optimization with equality and inequality constraints are proposed. Kuhn-Tucker sufficient optimality conditions are also developed. Two kinds of differences for two convex compact sets, proposed by...

• A geometric framework for nonconvex optimization duality using augmented lagrangian functions. Angelia Nedich; Asuman Ozdaglar // Journal of Global Optimization;Apr2008, Vol. 40 Issue 4, p545

AbstractÃ‚Â Ã‚Â We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a separation result for nonconvex sets via general concave surfaces. We use this separation...

• Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Fukasawa, Ricardo; Longo, Humberto; Lysgaard, Jens; De Aragão, Marcus Poggi; Reis, Marcelo; Uchoa, Eduardo; Werneck, Renato F. // Mathematical Programming;May2006, Vol. 106 Issue 3, p491

The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a...

• Conservation Laws and Associated Noether Type Vector Fields via Partial Lagrangians and Noetherâ€™s Theorem for the Liang Equation. Marwat, D. N. Khan; Kara, A. H.; Hayat, T. // International Journal of Theoretical Physics;Nov2008, Vol. 47 Issue 11, p3075

We show how one can construct conservation laws of the Liang equation which is not variational but may be regarded as Euler-Lagrange in part. This first requires the determination of the Noether-type symmetries associated with the partial Lagrangian. The final construction of the conservation...

• Symmetry Groups and Non-Planar Collisionless Action-Minimizing Solutions of the Three-Body Problem in Three-Dimensional Space. Ferrario, Davide L. // Archive for Rational Mechanics & Analysis;Mar2006, Vol. 179 Issue 3, p389

Periodic and quasi-periodic solutions of the n-body problem can be found as minimizers of the Lagrangian action functional restricted to suitable spaces of symmetric paths. The main purpose of this paper is to develop a systematic approach to the equivariant minimization for the three-body...

• Generalized Kï¿½hler Geometry from Supersymmetric Sigma Models. Bredthauer, Andreas; Lindstr�m, Ulf; Persson, Jonas; Zabzine, Maxim // Letters in Mathematical Physics;Sep2006, Vol. 77 Issue 3, p291

We give a physical derivation of generalized Kï¿½hler geometry. Starting from a supersymmetric nonlinear sigma model, we rederive and explain the results of Gualtieri (Generalized complex geometry, DPhil thesis, Oxford University, 2004) regarding the equivalence between generalized...

• Augmented Lagrangian functions for constrained optimization problems. Zhou, Y.; Yang, X. // Journal of Global Optimization;Jan2012, Vol. 52 Issue 1, p95

In this paper, in order to obtain some existence results about solutions of the augmented Lagrangian problem for a constrained problem in which the objective function and constraint functions are noncoercive, we construct a new augmented Lagrangian function by using an auxiliary function. We...

• Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming. Di Pillo, Gianni; Lucidi, Stefano; Palagi, Laura // Mathematics of Operations Research;Nov2005, Vol. 30 Issue 4, p897

We define a primal-dual algorithm model (second-order Lagrangian algorithm, SOLA) for inequality constrained optimization problems that generates a sequence converging to points satisfying the second-order necessary conditions for optimality. This property can be enforced by combining the...

• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization. Birgin, Ernesto; Martínez, J. // Computational Optimization & Applications;Apr2012, Vol. 51 Issue 3, p941

At each outer iteration of standard Augmented Lagrangian methods one tries to solve a box-constrained optimization problem with some prescribed tolerance. In the continuous world, using exact arithmetic, this subproblem is always solvable. Therefore, the possibility of finishing the subproblem...

Share

## Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library