Invex functions and constrained local minima

311Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

If a certain weakening of convexity holds for the objective and all constraint functions in a nonconvex constrained minimization problem, Hanson showed that the Kuhn-Tucker necessary conditions are sufficient for a minimum. This property is now generalized to a property, called K-invex, of a vector function in relation to a convex cone K. Necessary conditions and sufficient conditions are obtained for a function f to be K-invex. This leads to a new second order sufficient condition for a constrained minimum. © 1981, Australian Mathematical Society. All rights reserved.

Cite

CITATION STYLE

APA

Craven, B. D. (1981). Invex functions and constrained local minima. Bulletin of the Australian Mathematical Society, 24(3), 357–366. https://doi.org/10.1017/S0004972700004895

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free