×
Passy, Ury; Yutav, Shaul

Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints. (English) Zbl 0433.90063

Math. Program. 18, 248-273 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0433.90063

Cited in 3 Documents

MSC:

90C25 Convex programming

Keywords:

pseudo duality; unconstrained problems; equality constraints; Legendre transform; stationary points; convex functions; duality; nonconvex programming; constructive methods; calculation of pseudo dual
Cite Review PDF
Full Text: DOI

References:

[1] R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ. 1970). · Zbl 0193.18401
[2] W. Fenchel, ”On conjugate convex functions”,Canadian Journal of Mathematics 1 (1949) 73–77. · Zbl 0038.20902 · doi:10.4153/CJM-1949-007-x
[3] R.J. Duffin, E.L. Peterson and C. Zener,Geometric programming, (John Wiley, New York, 1967). · Zbl 0171.17601
[4] S. Yutav, ”Pseudo duality in mathematical programming”, Ph.D. Dissertation, Faculty of Industrial and Management Engineering, Technion (Haifa, 1978). · Zbl 0433.90063
[5] I. Ekeland, ”Legendre duality in nonconvex optimization and calculus of variations”,SIAM Journal on Control and Optimization 15 (1977) 905–934. · Zbl 0377.90089 · doi:10.1137/0315058
[6] U. Passy and S. Yutav, ”Pseudo duality in mathematical programming part A: unconstrained and equality constraints”, Operation Research, Statistics and Economics Mimeograph Series No. 208, Faculty of Indust. Engrg. and Management, Technion, Haifa, Israel. · Zbl 0433.90063
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.