The Lipschitzianity of convex vector and set-valued functions (Q286214): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Let \(X,Y\) be normed spaces and \(C\) a proper convex cone in \(Y\) inducing an order relation \(\leq_C\) on \(Y\). One puts \(Y^\bullet=Y\cup\{+\infty\}\), where \(+\infty\) is an ideal element attached to \(Y\) such that \(y\leq_C+\infty\) for all \(y\in Y\). The \(C\)-convexity of a function \(f:X\to Y^\bullet\) is defined in the usual way by using the order relation \(\leq_C\). A mapping \(f:X\to Y^\bullet\) is called \(C\)-bounded from above (from below) on a set \(A\subset X\) if there exists \(\mu>0\) such that \(f(A)\subset \mu U_Y-C\) (resp. \(f(A)\subset \mu U_Y+C\)), where \(U_Y\) denotes the closed unit ball of \(Y\). One of the main results of the paper (Theorem 2) asserts that if the cone \(C\) is normal and \(f:X\to Y^\bullet\) is \(C\)-convex and \(C\)-bounded from above on a neighborhood \(U\) of a point \(x_0\in \)\; int(dom\(\,Y)\), then \(f\) is locally Lipschitz on int(dom\(\,Y)\). A similar result was obtained by \textit{J. M. Borwein} [Proc. Lond. Math. Soc., III. Ser. 44, 420--444 (1982; Zbl 0487.46026)] under the stronger hypothesis of the existence of an element \(y_0\in Y\) such that \(f(x)\leq_C y_0\) for all \(x\in U\). Similar results are proved for set-valued maps \(F:X\rightrightarrows Y, \) under appropriate definitions of \(C\)-convexity, \(C\)-boundedness and Lipschitzianeity. Applications are given to necessary conditions for Pareto minimal points of vector-valued optimization problems where the objective function is \(C\)-convex and \(C\)-bounded, and to set-valued optimization problems. | |||
Property / review text: Let \(X,Y\) be normed spaces and \(C\) a proper convex cone in \(Y\) inducing an order relation \(\leq_C\) on \(Y\). One puts \(Y^\bullet=Y\cup\{+\infty\}\), where \(+\infty\) is an ideal element attached to \(Y\) such that \(y\leq_C+\infty\) for all \(y\in Y\). The \(C\)-convexity of a function \(f:X\to Y^\bullet\) is defined in the usual way by using the order relation \(\leq_C\). A mapping \(f:X\to Y^\bullet\) is called \(C\)-bounded from above (from below) on a set \(A\subset X\) if there exists \(\mu>0\) such that \(f(A)\subset \mu U_Y-C\) (resp. \(f(A)\subset \mu U_Y+C\)), where \(U_Y\) denotes the closed unit ball of \(Y\). One of the main results of the paper (Theorem 2) asserts that if the cone \(C\) is normal and \(f:X\to Y^\bullet\) is \(C\)-convex and \(C\)-bounded from above on a neighborhood \(U\) of a point \(x_0\in \)\; int(dom\(\,Y)\), then \(f\) is locally Lipschitz on int(dom\(\,Y)\). A similar result was obtained by \textit{J. M. Borwein} [Proc. Lond. Math. Soc., III. Ser. 44, 420--444 (1982; Zbl 0487.46026)] under the stronger hypothesis of the existence of an element \(y_0\in Y\) such that \(f(x)\leq_C y_0\) for all \(x\in U\). Similar results are proved for set-valued maps \(F:X\rightrightarrows Y, \) under appropriate definitions of \(C\)-convexity, \(C\)-boundedness and Lipschitzianeity. Applications are given to necessary conditions for Pareto minimal points of vector-valued optimization problems where the objective function is \(C\)-convex and \(C\)-bounded, and to set-valued optimization problems. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ştefan Cobzaş / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 46A40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 46N10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 49J53 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52A41 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C46 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6583146 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Lipschitz property | |||
Property / zbMATH Keywords: Lipschitz property / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vector-valued convex function | |||
Property / zbMATH Keywords: vector-valued convex function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
set-valued convex function | |||
Property / zbMATH Keywords: set-valued convex function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
optimality conditions | |||
Property / zbMATH Keywords: optimality conditions / rank | |||
Normal rank |
Revision as of 18:42, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Lipschitzianity of convex vector and set-valued functions |
scientific article |
Statements
The Lipschitzianity of convex vector and set-valued functions (English)
0 references
20 May 2016
0 references
Let \(X,Y\) be normed spaces and \(C\) a proper convex cone in \(Y\) inducing an order relation \(\leq_C\) on \(Y\). One puts \(Y^\bullet=Y\cup\{+\infty\}\), where \(+\infty\) is an ideal element attached to \(Y\) such that \(y\leq_C+\infty\) for all \(y\in Y\). The \(C\)-convexity of a function \(f:X\to Y^\bullet\) is defined in the usual way by using the order relation \(\leq_C\). A mapping \(f:X\to Y^\bullet\) is called \(C\)-bounded from above (from below) on a set \(A\subset X\) if there exists \(\mu>0\) such that \(f(A)\subset \mu U_Y-C\) (resp. \(f(A)\subset \mu U_Y+C\)), where \(U_Y\) denotes the closed unit ball of \(Y\). One of the main results of the paper (Theorem 2) asserts that if the cone \(C\) is normal and \(f:X\to Y^\bullet\) is \(C\)-convex and \(C\)-bounded from above on a neighborhood \(U\) of a point \(x_0\in \)\; int(dom\(\,Y)\), then \(f\) is locally Lipschitz on int(dom\(\,Y)\). A similar result was obtained by \textit{J. M. Borwein} [Proc. Lond. Math. Soc., III. Ser. 44, 420--444 (1982; Zbl 0487.46026)] under the stronger hypothesis of the existence of an element \(y_0\in Y\) such that \(f(x)\leq_C y_0\) for all \(x\in U\). Similar results are proved for set-valued maps \(F:X\rightrightarrows Y, \) under appropriate definitions of \(C\)-convexity, \(C\)-boundedness and Lipschitzianeity. Applications are given to necessary conditions for Pareto minimal points of vector-valued optimization problems where the objective function is \(C\)-convex and \(C\)-bounded, and to set-valued optimization problems.
0 references
Lipschitz property
0 references
vector-valued convex function
0 references
set-valued convex function
0 references
optimality conditions
0 references