Lipschitz B-vex functions and nonsmooth programming

DOI10.1023/A:1022643129733zbMath0886.90116OpenAlexW1583981470MaRDI QIDQ1357526

O. Diekmann

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

zbMATH Keywords

quasiconvex functionsClarke subdifferentialnonsmooth programmingnecessary optimality conditionsufficient optimality conditionB-vex functions

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25)

Related Items (10)

Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ Characterizations of pseudoconvex functions and semistrictly quasiconvex ones ⋮ Subvexormal functions and subvex functions ⋮ Optimality and duality with generalized semi-univexity. ⋮ Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Generalizations of \(E\)-convex and B-vex functions ⋮ On nonsmooth multiobjective programming with generalized univexity ⋮ ρ-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

Cites Work

• 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
• Optimization and nonsmooth analysis
• What is invexity?
• Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
• Convex Analysis

This page was built for publication: Lipschitz B-vex functions and nonsmooth programming