Abstract
This paper is intended to provide an updated survey of recent optimality theory for infinite-dimensional convex programming. It aims at establishing theoretical support for algorithmic developments. Two alternative strategies inspire the approaches presented in the paper. The first one consists of replacing the family of constraints by a single one, appealing to the supremum function, and is based on various characterizations of the subdifferential of the pointwise supremum of convex functions. The second one uses appropriate characterizations of affine consequent inequalities of the constraint system exploiting ad hoc constraint qualifications.
Sign-in/Register to access full text options 
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.
