Abstract
AbstractA theory of generalized gradients is presented for a class of Lipschitz vector-valued mappings from a Banach space to a locally convex order complete vector lattice. Necessary optimality conditions are obtained for nonconvex programming problems on Banach spaces with vector- valued operator constraints and/or an arbitrary set constraint. Sufficient optimality conditions are also obtained under mild convexity assumptions.
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 callMore From: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
Disclaimer: 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.
