There are two different approaches to the Dirichlet minimization problem for variational inte-grals with linear growth. On the one hand, one commonly considers a generalized formulation in the space of functions of bounded variation. On the other hand, there is a closely related maxi-mization problem in the space of divergence-free bounded vector fields, namely the dual problem in the sense of convex analysis. In this paper, we extend previous results on the duality correspondence between the general-ized and the dual problem to a full characterization of their extremals via pointwise extremality relations. Furthermore, we discuss related uniqueness issues for both kinds of solutions and their relevance in the regularity theory of generaliz...
We apply self-dual variational calculus to inverse problems, optimal control problems and homogeniza...
AbstractThe concept of efficiency is used to formulate duality for nondifferentiable multiobjective ...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet ...
We start our discussion with a class of nondifferentiable minimax programming problems in complex sp...
In this paper we will establish a new relationship between differentiability and optimization of conv...
Key words and phrases. Banach spaces, convex analysis, duality, calculus of variations, non-convex s...
Given a class of strictly convex and smooth integrands f with linear growth, we consider the minimiz...
AbstractThe concept of mixed-type duality has been extended to the class of multiobjective variation...
The aim of this work is to present several new results concerning duality in scalar convex optimizat...
We first study the minimizers, in the class of convex functions, of an elliptic functional with nonh...
summary:Integral functionals based on convex normal integrands are minimized subject to finitely man...
After revisiting the well-known relationship with the minimax theory, some duality results for const...
We establish that the Dirichlet problem for linear growth functionals on BD, the functions of bounde...
We apply self-dual variational calculus to inverse problems, optimal control problems and homogeniza...
AbstractThe concept of efficiency is used to formulate duality for nondifferentiable multiobjective ...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractWe examine a notion of duality which appears to be useful in situations where the usual conv...
We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet ...
We start our discussion with a class of nondifferentiable minimax programming problems in complex sp...
In this paper we will establish a new relationship between differentiability and optimization of conv...
Key words and phrases. Banach spaces, convex analysis, duality, calculus of variations, non-convex s...
Given a class of strictly convex and smooth integrands f with linear growth, we consider the minimiz...
AbstractThe concept of mixed-type duality has been extended to the class of multiobjective variation...
The aim of this work is to present several new results concerning duality in scalar convex optimizat...
We first study the minimizers, in the class of convex functions, of an elliptic functional with nonh...
summary:Integral functionals based on convex normal integrands are minimized subject to finitely man...
After revisiting the well-known relationship with the minimax theory, some duality results for const...
We establish that the Dirichlet problem for linear growth functionals on BD, the functions of bounde...
We apply self-dual variational calculus to inverse problems, optimal control problems and homogeniza...
AbstractThe concept of efficiency is used to formulate duality for nondifferentiable multiobjective ...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...