Simplified optimality conditions for minimizing the difference of vector-valued functions
This article is a valuable contribution to the axiomatic theory on a problem (P) of nonconvex minimization of a vector-valued function. The objective function \(g(x)- h(x)\) to be minimized is defined by \(g,h: X\to Z\), \(Z\) being an ordered topological vector space endowed with a partial ordering given by a convex cone \(P\subset Z\) and artificial elements \(\pm\infty\) adjoined. By this setting, the authors extend results from the case \(Z= \mathbb{R}\). As analytical tools, for an arbitrary function \(f\), a nonempty family \(\Phi\) of functions on \(X\) and some \(\alpha\in Z\), the \(\varepsilon\)-\(\Phi\)-subdifferential and the \(\alpha\)-\(\Phi\)-minorant of \(f\) are provided. Herewith, for \((f:=)h\) assumptions (H1,2) are made, saying that \(h\) is almost \(\Phi\)-supported or \(\Phi\)-supported, respectively. Several examples are given in which \(X\) is, e.g., a locally convex topological vector space or a metric space, \(\Phi\) consists of continuous (linear or real-valued) functions, and \(h\) is lower semicontinuous, proper and/or convex. A first main result says that under (H1) a point \(x^0\) from the common domain of \(g\), \(h\) solves (P) if and if only if for all \(\varepsilon\geq 0\) at \(x^0\) the subdifferential of \(h\) is lying in the one of \(g\). Under (H2) and stability of \(\Phi\) with respect to dilatation and finite suprema, a second one makes the same characterization by referring to \(\varepsilon= 0\) only. A third one equivalently represents the forgoing two characterizing conditions by duality conditions involving \(\Phi\)-conjugate functions. The authors conclude by related results, e.g., on representation of the \(\varepsilon\)-subdifferential of a proper \(h\) referring to the graph of the \(0\)-subdifferential of \(h\). The article is clearly written and carefully proved.
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for vector optimization problems with difference of convex maps
- The optimality conditions of differentiable vector optimization problems
- Optimality conditions for approximate solutions of vector optimization problems
- Refined optimality conditions for differences of convex functions
- Optimality conditions for vector optimization problems
- Optimality conditions in the problem of maximization of the difference of two convex functions
- On optimality conditions for vector variational inequalities
- scientific article; zbMATH DE number 4176847
- A duality principle for non-convex optimisation and the calculus of variations
- A Fenchel-Rockafellar type duality theorem for maximization
- A formula on the approximate subdifferential of the difference of convex functions
- Conjugate functions for convex and nonconvex duality
- scientific article; zbMATH DE number 3710458 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 687771 (Why is no real title available?)
- scientific article; zbMATH DE number 1568702 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
- Kolmogorov conditions for vectorial optimization problems
- MINKOWSKI DUALITY AND ITS APPLICATIONS
- On \Phi -Convexity in Extremal Problems
- On minima of the difference of functions
- Sandwich Theorems for Semicontinuous Operators
- On the subdifferentiability of the difference of two functions and local minimization
- Subdifferential and optimality conditions for the difference of set-valued mappings
- A modified proximal point method for DC functions on Hadamard manifolds
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
- (-)efficiency in difference vector optimization
- Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
- Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
- Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions
- Sufficient optimality conditions for a bilevel semivectorial D.C. problem
- Optimality conditions for vector optimization problems with difference of convex maps
- On the optimality conditions for D.C. vector optimization problems
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- The directional subdifferential of the difference of two convex functions
- Focus on sufficient optimality conditions in D.C. vector optimization
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- -weak Pareto minimality in D. C. vector optimization
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for the difference of convex set-valued mappings
This page was built for publication: Simplified optimality conditions for minimizing the difference of vector-valued functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942220)
