Quasiconvex duality theory by generalized conjugation methods
Author:
- 1 January 1988
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 19 (5) , 603-652
Abstract
We survey duality theories for quasiconvex optimization problems, based on notions of generalized conjugation. Some of them are obtained from Moreau's generalized conjugation, while the others are special cases of the so-called H-duality. The relationship existing between the two kinds of approaches is described.Keywords
This publication has 44 references indexed in Scilit:
- Φ-Conjugation and Noneonvex Optimization. A Survey (Part III)Optimization, 1985
- Duality in generalized linear fractional programmingMathematical Programming, 1983
- œ-conjugation and nonconvex optimization. a survey (part i)Mathematische Operationsforschung und Statistik. Series Optimization, 1983
- On abstract duality in mathematical programmingMathematical Methods of Operations Research, 1982
- About differentiability of order one of quasiconvex functions onR nJournal of Optimization Theory and Applications, 1982
- Recent Results on Φ-Conjugation and Nonconvex Optimization1982
- Calculating surrogate constraintsMathematical Programming, 1980
- On $\Phi $-Convexity in Extremal ProblemsSIAM Journal on Control and Optimization, 1978
- An Extension of Duality-Stability Relations to Nonconvex Optimization ProblemsSIAM Journal on Control and Optimization, 1977
- Generalized Conjugate FunctionsMathematische Operationsforschung und Statistik. Series Optimization, 1977