Lipschitz B-vex functions and nonsmooth programming
From MaRDI portal
Publication:1357526
DOI10.1023/A:1022643129733zbMath0886.90116MaRDI QIDQ1357526
Publication date: 10 May 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022643129733
quasiconvex functions; Clarke subdifferential; nonsmooth programming; necessary optimality condition; sufficient optimality condition; B-vex functions
90C25: Convex programming
49J52: Nonsmooth analysis
26B25: Convexity of real functions of several variables, generalizations
Related Items
ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences, Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints, On nonsmooth multiobjective programming with generalized univexity, Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity, Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems, Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity, Generalizations of \(E\)-convex and B-vex functions, Subvexormal functions and subvex functions, Characterizations of pseudoconvex functions and semistrictly quasiconvex ones, Optimality and duality with generalized semi-univexity.
Cites Work
- Unnamed Item
- On sufficiency of the Kuhn-Tucker conditions
- B-vex functions
- Generalized B-vex functions and generalized B-vex programming
- Generalization of preinvex and B-vex functions
- Characterization of nonsmooth functions through their generalized gradients
- What is invexity?
- Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
- Convex Analysis
