Showing 1 - 10 of 10
The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and regularize it in two steps into a differentiable strongly...
Persistent link: https://www.econbiz.de/10010998330
Persistent link: https://www.econbiz.de/10011406959
Persistent link: https://www.econbiz.de/10010995376
A fruitful idea, when providing subdifferential formulae and dual representations for convex risk measures, is to make use of the conjugate duality theory in convex optimization. In this paper we underline the outstanding role played by the qualification conditions in the context of different...
Persistent link: https://www.econbiz.de/10010999580
For an optimization problem with a composed objective function and composed constraint functions we determine, by means of the conjugacy approach based on the perturbation theory, some dual problems to it. The relations between the optimal objective values of these duals are studied. Moreover,...
Persistent link: https://www.econbiz.de/10010847933
A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular...
Persistent link: https://www.econbiz.de/10010999878
For an optimization problem with a composed objective function and composed constraint functions we determine, by means of the conjugacy approach based on the perturbation theory, some dual problems to it. The relations between the optimal objective values of these duals are studied. Moreover,...
Persistent link: https://www.econbiz.de/10010999934
A fruitful idea, when providing subdifferential formulae and dual representations for convex risk measures, is to make use of the conjugate duality theory in convex optimization. In this paper we underline the outstanding role played by the qualification conditions in the context of different...
Persistent link: https://www.econbiz.de/10010759180
A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular...
Persistent link: https://www.econbiz.de/10010759465
Persistent link: https://www.econbiz.de/10009149546