Related papers: Duality Between Lagrangians and Rockafellians
In practice, optimization models are often prone to unavoidable inaccuracies due to dubious assumptions and corrupted data. Traditionally, this placed special emphasis on risk-based and robust formulations, and their focus on…
This paper proposes a novel approach to solving nonlinear programming problems using a sharp augmented Lagrangian method with a smoothing technique. Traditional sharp augmented Lagrangian methods are known for their effectiveness but are…
A dual formalism for Lagrange multipliers is developed. The formalism is used to minimize an action function $S(q_2,q_1,T)$ without any dynamical input other than that $S$ is convex. All the key equations of analytical mechanics -- the…
Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify…
We generalize the Galileon duality to any single scalar field Lagrangian coupled locally to any matter field. Under the duality, a generalized Galileon maps into another generalized Galileon via a one parameter group of transformations,…
Recent advancements in data science have significantly elevated the importance of orthogonally constrained optimization problems. The Riemannian approach has become a popular technique for addressing these problems due to the advantageous…
In this paper, we propose a penalty dual-primal augmented lagrangian method for solving convex minimization problems under linear equality or inequality constraints. The proposed method combines a novel penalty technique with updates the…
The notion of duality -- that a given physical system can have two different mathematical descriptions -- is a key idea in modern theoretical physics. Establishing a duality in lattice statistical mechanics models requires the construction…
In recent years, there has been a surge of interest in studying different ways to reformulate nonconvex optimization problems, especially those that involve binary variables. This interest surge is due to advancements in computing…
This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory. It is proved that if both target function and…
We analyze the relation between the concept of auxiliary variables and the Inverse problem of the calculus of variations to construct a Lagrangian from a given set of equations of motion. The problem of the construction of a consistent…
Symmetries in the Lagrangian formalism of arbitrary order are analysed with the help of the so-called Anderson-Duchamp-Krupka equations. For the case of second order equations and a scalar field we establish a polynomial structure in the…
Polarity is a fundamental reciprocal duality of $n$-dimensional projective geometry which associates to points polar hyperplanes, and more generally $k$-dimensional convex bodies to polar $(n-1-k)$-dimensional convex bodies. It is…
The augmented Lagrangian method (ALM) is a classical optimization tool that solves a given "difficult" (constrained) problem via finding solutions of a sequence of "easier"(often unconstrained) sub-problems with respect to the original…
Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tutorial gives an…
We extend the notion of polar duality to pairs of transverse Lagrangian planes in the standard symplectic space. This allows us to show that polar duality has a natural interpretation in terms of symplectic geometry. We apply our results to…
This paper provides a dual formulation of the optimal consumption problem with internal multiplicative habit formation. In this problem, the agent derives utility from the ratio of consumption to the internal habit component. Due to this…
We study a class of optimization problems in which the objective function is given by the sum of a differentiable but possibly nonconvex component and a nondifferentiable convex regularization term. We introduce an auxiliary variable to…
We develop the concept and the calculus of anti-self dual (ASD) Lagrangians which seems inherent to many questions in mathematical physics, geometry, and differential equations. They are natural extensions of gradients of convex functions…
A large number of objectives have been proposed to train latent variable generative models. We show that many of them are Lagrangian dual functions of the same primal optimization problem. The primal problem optimizes the mutual information…