Abstract

Usually local or global convexity properties of the Lagrange function are employed in second order conditions for some point \( \overline{x} \) to be a local or global solution for a constrained minimization problem. In this paper we present, in section 1, an appropriate generalization of local and global convexity, which takes into account the structure of the feasible set and thus enables us to narrow the usual gap between necessary and sufficient optimality conditions. In section 2 we deal with quadratic problems for which we specify similar global optimality conditions.

Full Text
Paper version not known

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 call

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.