Related papers: Lagrangian Homotopy Analysis Method using the Leas…
We provide a new canonical approach for studying the quantum mechanical damped harmonic oscillator based on the doubling of degrees of freedom approach. Explicit expressions for Lagrangians of the elementary modes of the problem,…
Using well known Lagrangean techniques for uncovering the gauge symmetries of a Lagrangean, we derive the transformation laws for the phase space variables corresponding to local symmetries of the Hamilton equations of motion. These…
In this paper we study an unconventional inexact Augmented Lagrangian Method (ALM) for convex optimization problems, as first proposed by Bertsekas, wherein the penalty term is a potentially non-Euclidean norm raised to a power between one…
Weak KAM theory for discount Hamilton-Jacobi equations and corresponding discount Lagrangian/Hamiltonian dynamics is developed. Then it is applied to error estimates for viscosity solutions in the vanishing discount process. The main…
An application of variational principle to bifurcation of periodic solution in Lagrangian mechanics is shown. A few higher derivatives of the action integral at a periodic solution reveals the behaviour of the action in function space near…
We discuss a recently proposed variational principle for deriving the variational equations associated to any Lagrangian system. The principle gives simultaneously the Lagrange and the variational equations of the system. We define a new…
Approximate Message Passing (AMP) is an efficient iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions, such as sparse systems. In AMP, a so-called Onsager term is added to…
The Highly Adaptive Lasso (HAL) is a nonparametric regression method that achieves almost dimension-free convergence rates under minimal smoothness assumptions, but its implementation can be computationally prohibitive in high dimensions…
Inexact proximal augmented Lagrangian methods (ipALMs) have been widely used for solving linearly constrained convex optimization problems, owing to their strong theoretical guarantees and excellent numerical performance. In practice,…
We consider the augmented Lagrangian method (ALM) as a solver for the fused lasso signal approximator (FLSA) problem. The ALM is a dual method in which squares of the constraint functions are added as penalties to the Lagrangian. In order…
Homotopy optimization is a traditional method to deal with a complicated optimization problem by solving a sequence of easy-to-hard surrogate subproblems. However, this method can be very sensitive to the continuation schedule design and…
Large-scale constrained optimization is pivotal in modern scientific, engineering, and industrial computation, often involving complex systems with numerous variables and constraints. This paper provides a unified and comprehensive…
The hard margin loss function has been at the core of the support vector machine (SVM) research from the very beginning due to its generalization capability.On the other hand, the cardinality constraint has been widely used for feature…
A new algorithm for time dependent Hamilton Jacobi equations on networks, based on semi Lagrangian scheme, is proposed. It is based on the definition of viscosity solution for this kind of problems recently given in. A thorough convergence…
We consider the convex minimization model with both linear equality and inequality constraints, and reshape the classic augmented Lagrangian method (ALM) by balancing its subproblems. As a result, one of its subproblems decouples the…
In this paper we study decomposition methods based on separable approximations for minimizing the augmented Lagrangian. In particular, we study and compare the Diagonal Quadratic Approximation Method (DQAM) of Mulvey and Ruszczy\'{n}ski and…
We consider a least absolute deviation (LAD) approach to the robust phase retrieval problem that aims to recover a signal from its absolute measurements corrupted with sparse noise. To solve the resulting non-convex optimization problem, we…
L1-minimization refers to finding the minimum L1-norm solution to an underdetermined linear system b=Ax. Under certain conditions as described in compressive sensing theory, the minimum L1-norm solution is also the sparsest solution. In…
A preconditioning strategy for the Powell-Hestenes-Rockafellar Augmented Lagrangian method (ALM) is presented. The scheme exploits the structure of the Augmented Lagrangian Hessian. It is a modular preconditioner consisting of two blocks.…
In this work, the benefits of the phase fitting technique are embedded in high order discrete Lagrangian integrators. The proposed methodology creates integrators with zero phase lag in a test Lagrangian in a similar way used in phase…