This chapter surveys key concepts in convex duality theory and their application to the analysis and numerical solution of problem archetypes in imaging
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
The primary aim of this book is to present notions of convex analysis which constitute the basic und...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
This chapter surveys key concepts in convex duality theory and their application to the analysis and...
We study convex programs that involve the minimization of a convex function over a convex subset of ...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
In Part I of this work we derived a duality theorem for partially finite convex programs, problems f...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
AbstractA completely symmetric duality theory is derived for convex integral functionals. As an exam...
Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered wi...
Summary. The number of computational or theoretical applications of nonlinear duality theory is smal...
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
Revised 04-07-09Our Goals for the Week A brief introduction to some key ideas from optimization that...
The duality principle provides that optimization problems may be viewed from either of two perspecti...
A duality theory using conjugate functions is established for mathematical programs that involve the...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
The primary aim of this book is to present notions of convex analysis which constitute the basic und...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
This chapter surveys key concepts in convex duality theory and their application to the analysis and...
We study convex programs that involve the minimization of a convex function over a convex subset of ...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
In Part I of this work we derived a duality theorem for partially finite convex programs, problems f...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
AbstractA completely symmetric duality theory is derived for convex integral functionals. As an exam...
Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered wi...
Summary. The number of computational or theoretical applications of nonlinear duality theory is smal...
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
Revised 04-07-09Our Goals for the Week A brief introduction to some key ideas from optimization that...
The duality principle provides that optimization problems may be viewed from either of two perspecti...
A duality theory using conjugate functions is established for mathematical programs that involve the...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
The primary aim of this book is to present notions of convex analysis which constitute the basic und...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...