A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
Radu Ioan Boţ, Sorin‐Mihai Grad, Gert Wanka
Abstract
Open-access reader
Radu Ioan Boţ, Sorin‐Mihai Grad, Gert Wanka
Abstract
Open-access reader
Abstract In this paper we work in separated locally convex spaces where we give equivalent statements for the formulae of the conjugate function of the sum of a convex lower‐semicontinuous function and the precomposition of another convex lower‐semicontinuous function which is also K ‐increasing with a K ‐convex K ‐epi‐closed function, where K is a nonempty closed convex cone. These statements prove to be the weakest constraint qualifications given so far under which the formulae for the subdifferential of the mentioned sum of functions are valid. Then we deliver constraint qualifications inspired from them that guarantee some conjugate duality assertions. Two interesting special cases taken from the literature conclude the paper. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
OpenAlex reports 44 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract In this paper we work in separated locally convex spaces where we give equivalent statements for the formulae of the conjugate function of the sum of a convex lower‐semicontinuous function and the precomposition of another convex lower‐semicontinuous function which is also K ‐increasing with a K ‐convex K ‐epi‐closed function, where K is a nonempty closed convex cone. These statements prove to be the weakest constraint qualifications given so far under which the formulae for the subdifferential of the mentioned sum of functions are valid. Then we deliver constraint qualifications inspired from them that guarantee some conjugate duality assertions. Two interesting special cases taken from the literature conclude the paper. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Key concepts: Subderivative, Mathematics, Convex conjugate, Duality (order theory), Constraint (computer-aided design), Convex analysis, Convex set, Regular polygon