A note on strong pseudoconvexity
A strongly pseudoconvex function is generalized to non-smooth settings. A complete characterization of the strongly pseudoconvex radially lower semicontinuous functions is obtained.
Characterizations of the Solution Sets of Generalized Convex Minimization Problems
2000 Mathematics Subject Classification: 90C26, 90C20, 49J52, 47H05, 47J20. In this paper we obtain some simple characterizations of the solution sets of a pseudoconvex program and a variational inequality. Similar characterizations of the solution set of a quasiconvex quadratic program are derived. Applications of these characterizations are given.
First Order Characterizations of Pseudoconvex Functions
First order characterizations of pseudoconvex functions are investigated in terms of generalized directional derivatives. A connection with the invexity is analysed. Well-known first order characterizations of the solution sets of pseudolinear programs are generalized to the case of pseudoconvex programs. The concepts of pseudoconvexity and invexity do not depend on a single definition of the generalized directional derivative.
First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints
2000 Mathematics Subject Classification: 90C46, 90C26, 26B25, 49J52. The constrained optimization problem min f(x), gj(x) ≤ 0 (j = 1,…p) is considered, where f : X → R and gj : X → R are nonsmooth functions with domain X ⊂ Rn. First-order necessary and first-order sufficient optimality conditions are obtained when gj are quasiconvex functions. Two are the main features of the paper: to treat nonsmooth problems it makes use of Dini derivatives; to obtain more sensitive conditions, it...
Page 1