Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints

DOI10.1007/BF01588322MaRDI QIDQ3872213zbMATH OpenFDO

Authors S. Yutav, Ury Passy

Publication date 1980

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01588322

zbMATH Keywords

calculation of pseudo dualconstructive methodsconvex functionsdualityequality constraintsLegendre transformnonconvex programmingpseudo dualitystationary pointsunconstrained problems

Mathematics Subject Classification ID

Convex programming (90C25)

Cites work

• Convex Analysis
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• Legendre Duality in Nonconvex Optimization and Calculus of Variations
• On Conjugate Convex Functions
• Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints

Cited in

(3)

• Duality for a class of quasiconvex programs
• Static duality and a stationary-action application
• Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints

This page was built for publication: Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3872213)