Abstract
Bifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presented under a common point of view. Stability criteria, weaker and more natural than the usual Slater type constraint qualification hypotheses, are obtained for any of these types of duality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
