Lipschitz B-vex functions and nonsmooth programming

DOI10.1023/A:1022643129733MaRDI QIDQ1357526zbMATH OpenOpenAlexFDO

Authors 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

necessary optimality conditionClarke subdifferentialquasiconvex functionssufficient optimality conditionnonsmooth programmingB-vex functions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5856583
• A class of Lipschitz \(B\)-\( (p,r)\)-invex functions and nonsmooth programming
• Nonsmooth \(B\)-preinvex functions.
• LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
• Further Properties of b-Vex Functions

Cites work

• B-vex functions
• Characterization of nonsmooth functions through their generalized gradients
• Convex Analysis
• Generalization of preinvex and B-vex functions
• Generalized B-vex functions and generalized B-vex programming
• On sufficiency of the Kuhn-Tucker conditions
• Optimization and nonsmooth analysis
• Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
• What is invexity?

Cited in

(12)

• scientific article; zbMATH DE number 5856583 (Why is no real title available?)
• Generalizations of \(E\)-convex and B-vex functions
• Subvexormal functions and subvex functions
• On nonsmooth multiobjective programming with generalized univexity
• Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity
• ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
• Optimality and duality with generalized semi-univexity.
• Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
• Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
• NSM constrained approximation of Lipschitz functions from data
• Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
• Characterizations of pseudoconvex functions and semistrictly quasiconvex ones

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357526)