Simplified optimality conditions for minimizing the difference of vector-valued functions

DOI10.1023/A:1017535424813zbMath0984.90053MaRDI QIDQ5942220

Fabián Flores-Bazan, Werner Oettli

Publication date: 28 August 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

conjugate functions; nonconvex minimization of a vector-valued function; phi-subdifferentials

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

Related Items

The directional subdifferential of the difference of two convex functions, Optimality conditions for D.C. vector optimization problems under reverse convex constraints, Optimality conditions for the difference of convex set-valued mappings, On the subdifferentiability of the difference of two functions and local minimization, Subdifferential and optimality conditions for the difference of set-valued mappings, Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A duality principle for non-convex optimisation and the calculus of variations
• Conjugate functions for convex and nonconvex duality
• On minima of the difference of functions
• Kolmogorov conditions for vectorial optimization problems
• Sandwich Theorems for Semicontinuous Operators
• A formula on the approximate subdifferential of the difference of convex functions
• On $\Phi $-Convexity in Extremal Problems
• A Fenchel-Rockafellar type duality theorem for maximization
• MINKOWSKI DUALITY AND ITS APPLICATIONS