Abstract
In this paper some concepts and techniques of Mathematical Programming are extended in an intrinsic way from the Euclidean space to the sphere. In particular, the notion of convex functions, variational problem and monotone vector fields are extended to the sphere and several characterizations of these notions are shown. As an application of the convexity concept, necessary and sufficient optimality conditions for constrained convex optimization problems on the sphere are derived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.