Characterization Theorems Associated with (F, ρ)-Convex and (F, ρ)-Pseudoconvex Functions

DOI10.1080/01630560903123288zbMath1179.49017OpenAlexW2038197787MaRDI QIDQ3184200

Krzysztof Kisiel

Publication date: 13 October 2009

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a914174536

zbMATH Keywords

invex functionsClarke's subgradientgeneralized convex, pseudo-convex and quasi-convex functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Related Items (1)

Parameter-free duality models and applications to semi-infinite minmax fractional programming based on second-order (\(\phi,\eta ,\rho ,\theta,\tilde{m}\))-sonvexities

Cites Work

• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• Nonsmooth invexity
• Optimization and nonsmooth analysis
• What is invexity?
• Duality with generalized convexity
• Invex functions and constrained local minima
• ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs

This page was built for publication: Characterization Theorems Associated with (F, ρ)-Convex and (F, ρ)-Pseudoconvex Functions