In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function φ. This property is then used to investigate the second-order properties of the Moreau-Yosida regularization η of the function φ, e.g., the semismoothness of the gradient g of the regularized function η. We show that φ and g are p...

A Lagrangian study of two-dimensional turbulence for two different geometries, a periodic and a confined circular geometry, is presented to investigate the influence of solid boundaries on the Lagrangian dynamics. It is found that the Lagrangian acceleration is even more intermittent in the confined domain than in the periodic domain. The flatness of the Lagrangian acceleration as a function of...

After reducing a system of higher-order regular Lagrangian into first-order singular Lagrangian using constrained auxiliary description, the Hamilton-Jacobi function is constructed. Besides, the quantization of the system is investigated using the canonical path integral approximation.

The implicit Lagrangian was first proposed by Mangasarian and Solodov as a smooth merit function for the nonnegative orthant complementarity problem. It has attracted much attention in the past ten years because of its utility in reformulating complementarity problems as unconstrained minimization problems. In this paper, exploiting the Jordan-algebraic structure, we extend it to the vector-val...

In the solution methods of the symmetric cone complementarity problem (SCCP), the squared norm of a complementarity function serves naturally as a merit function for the problem itself or the equivalent system of equations reformulation. In this paper, we study the growth behavior of two classes of such merit functions, which are induced by the smooth EP complementarity functions and the smooth...

We are considering the application of the Augmented Lagrangian algorithms with quadratic penalty, to convex problems of quadratic programming. The problems of quadratic programming are composites of quadratic objective function and linear constraints. This important class of problems will be generated through the algorithm of sequential quadratic programming, where at each iteration the quadrat...

Adiscrete version of Lagrangian reduction is developed within the context of discrete time Lagrangian systems on G G, where G is a Lie group. We consider the case when the Lagrange function is invariantwith respect to the action ofan isotropysubgroup ofa¢xed element in the representation space of G. Within this context, the reduction of the discrete Euler^Lagrange equations is shown to lead to ...

A new theory for determining the mass function of cosmic structures is presented. It relies on a realistic treatment of collapse dynamics. Gravitational collapse is analyzed in the Lagrangian perturbative framework. Lagrangian perturbations provide an approximation of truncated type, i.e. small-scale structure is filtered out. The collapse time is suitably defined as the instant at which orbit ...

The Principle of Least Action is used with a simple Lagrangian density, involving second-order derivatives of the wave function, to obtain the Schrödinger equation. A Hamiltonian density obtained from this simple Lagrangian density shows that Hamilton’s equations also give the Schrödinger equation. This simple Lagrangian density is equivalent to a standard Lagrangian density with first-order de...

In this paper, the existence of an optimal path and its convergence to the optimal set of a primal problem of minimizing an extended real-valued function are established via a generalized augmented Lagrangian and corresponding generalized augmented Lagrangian problems, in which no convexity is imposed on the augmenting function. These results further imply a zero duality gap property between th...