Related papers: Duality Between Lagrangians and Rockafellians
We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the…
We present a primal-dual majorization-minimization method for solving large-scale linear programs. A smooth barrier augmented Lagrangian (SBAL) function with strict convexity for the dual linear program is derived. The…
We develop an efficient method for solving non-convex constrained optimization problems that are pervasive in economics. The optimal solution to these problems often involves randomization. We employ a Lagrangian framework and prove that…
Integer programming with block structures has received considerable attention recently and is widely used in many practical applications such as train timetabling and vehicle routing problems. It is known to be NP-hard due to the presence…
Duality is one of the oldest known symmetries of Maxwell equations. In recent years the significance of duality symmetry has been recognized in superstrings and high energy physics and there has been a renewed interest on the question of…
Non-standard Lagrangians do not display any discernible energy-like terms, yet they give the same equations of motion as standard Lagrangians, which have easily identifiable energy-like terms. A new method to derive non-standard Lagrangians…
For the existence of strong duality in convex optimization regularity conditions play an indisputable role. We mainly deal in this paper with regularity conditions formulated by means of different generalizations of the notion of interior…
Previous work in the literature has studied the Hamiltonian structure of an R-squared model of gravity with torsion in a closed Friedmann-Robertson-Walker universe. Within the framework of Dirac's theory, torsion is found to lead to a…
Pluri-Lagrangian systems are variational systems with the multi-dimensional consistency property. This notion has its roots in the theory of pluriharmonic functions, in the Z-invariant models of statistical mechanics, in the theory of…
We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an intractable estimation problem as one defined on a more tractable graph,…
We consider a general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set.…
This article develops a duality principle for a class of optimization problems in $\mathbb{R}^n$. The results are obtained based on standard tools of convex analysis and on a well known result of Toland for D.C. optimization. Global…
Necessary optimality conditions in Lagrangian form and the sequential minimization framework are extended to mixed-integer nonlinear optimization, without any convexity assumptions. Building upon a recently developed notion of local…
The application of the Legendre transformation to a hyperregular Lagrangian system results in a Hamiltonian vector field generated by a Hamiltonian defined on the phase space of the mechanical system. The Legendre transformation in its…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…
In this paper we propose a primal-dual dynamical approach to the minimization of a structured convex function consisting of a smooth term, a nonsmooth term, and the composition of another nonsmooth term with a linear continuous operator. In…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…
Risk-aware control, though with promise to tackle unexpected events, requires a known exact dynamical model. In this work, we propose a model-free framework to learn a risk-aware controller with a focus on the linear system. We formulate it…
Guided by the symmetries of the Euler-Lagrange equations of motion, a study of the constrained dynamics of singular Lagrangians is presented. We find that these equations of motion admit a generalized Lie symmetry, and on the Lagrangian…
We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no…