Abstract
In this paper we show that in several important classes of optimization problems, like mathematical programming with k-smooth data, quadratic programming in a Hilbert space, convex programming in a Banach space, semi-infinite programming, and optimal control of linear systems with quadratic cost, most of the problems (in the Baire category sense) are well-posed. This is derived from a general variational principle for problems with functional constraints.
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.
