Related papers: Lagrange duality, stability and subdifferentials i…
Bilevel programs are optimization problems where some variables are solutions to optimization problems themselves, and they arise in a variety of control applications, including: control of vehicle traffic networks, inverse reinforcement…
We prove that the scalar and $2\times 2$ matrix differential operators which preserve the simplest scalar and vector-valued polynomial modules in two variables have a fundamental Lie algebraic structure. Our approach is based on a general…
We study conjugate and Lagrange dualities for composite optimization problems within the framework of abstract convexity. We provide conditions for zero duality gap in conjugate duality. For Lagrange duality, intersection property is…
This paper is a continuation of [13], where new variational principles were introduced based on the concept of anti-selfdual (ASD) Lagrangians. We continue here the program of using these Lagrangians to provide variational formulations and…
We derive the Euler-Lagrange equations for minimizers of causal variational principles in the non-compact setting with constraints, possibly prescribing symmetries. Considering first variations, we show that the minimizing measure is…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…
The aim of this paper is to study the convergence of the primal-dual dynamics pertaining to Support Vector Machines (SVM). The optimization routine, used for determining an SVM for classification, is first formulated as a dynamical system.…
This paper studies duality and optimality conditions for general convex stochastic optimization problems. The main result gives sufficient conditions for the absence of a duality gap and the existence of dual solutions in a locally convex…
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…
The stability properties of simple element choices for the mixed formulation of the Laplacian are investigated numerically. The element choices studied use vector Lagrange elements, i.e., the space of continuous piecewise polynomial vector…
In this work we present two particular cases of the general duality result for linear optimisation problems over signed measures with infinitely many constraints in the form of integrals of functions with respect to the decision variables…
We consider all possible dynamical theories which evolve two transverse vector fields out of a three-dimensional Euclidean hyperplane, subject to only two assumptions: (i) the evolution is local in space, and (ii) the theory is invariant…
Finite-dimensional linear programs satisfy strong duality (SD) and have the "dual pricing" (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of the right-hand-side vector, there exists a dual solution…
In this paper we present a new Lagrange dual problem associated to a primal DC optimization problem under the additivity condition (AC). As usual for DC programming, even weak duality is not guaranteed for free and, due to this issue, we…
In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization…
Recently, Yamanaka and Yamashita proposed the so-called positively homogeneous optimization problem, which includes many important problems, such as the absolute-value and the gauge optimizations. They presented a closed form of the dual…
The recent results of An, Luan, and Yen [Differential stability in convex optimization via generalized polyhedrality. Vietnam J. Math. https://-doi.org/10.1007/s10013-024-00721-y] on differential stability of parametric optimization…
The problem of minimizing an integral functional of a vector-valued Lagrangian on a set of admissible arcs with given endpoints is considered. The problem is tackled by embedding it into a set-optimization problem such that the image space…
A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations…