Bulletin of the Australian Mathematical Society · 2006 · 30 citations · 8 references
Natural SciencesComputer ScienceOptimizationConstrained OptimizationConvex AnalysisConvex OptimizationGradient-based OptimizationNonlinear ProgrammingOptimization TheoryConvex FunctionsConvexityNonconvex OptimizationNonsmooth Convex OptimizationNonsmooth OptimizationOptimality ConditionsQuasiconvex FunctionsStrong Convexity
Approximate convex functions are characterised in terms of Clarke generalised gradient. We apply this characterisation to derive optimality conditions for quasi efficient solutions of nonsmooth vector optimisation problems. Two new classes of generalised approximate convex functions are defined and mixed duality results are obtained.
8