A duality theory using conjugate functions is established for mathematical programs that involve the composition of two convex functions. This generalizes our earlier work in quadratic and composite geometric programs. A specific application to minimax programs is given
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractIn a recent paper D. J. White presented a new approach to the problem of minimizing a differ...
AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
We present a constructive approach to solving convex programming problems in separable form and new...
AbstractA very powerful approach to duality in mathematical programming is the theory of generalised...
AbstractEgudo derived some duality theorems for Multi-objective programs using the concept of effici...
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...
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractIn a recent paper D. J. White presented a new approach to the problem of minimizing a differ...
AbstractThis expository note develops Rockafellar's (1968, 1970) conjugate-duality theory for convex...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
We present a constructive approach to solving convex programming problems in separable form and new...
AbstractA very powerful approach to duality in mathematical programming is the theory of generalised...
AbstractEgudo derived some duality theorems for Multi-objective programs using the concept of effici...
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...
textabstractThis paper presents a unified study of duality properties for the problem of minimizing ...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
DOI
Add to ORKG