Subdifferential test for optimality (Q2249811): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1212.0532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on epsilon-subgradients and maximal monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques of variational analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minty variational inequalities, increase-along-rays property and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the variational principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate subdifferentials and applications 3: the metric theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferential estimate of the directional derivative, optimality criterion and separation principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized derivative for calm and stable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradients of a convex function obtained from a directional derivative / rank
 
Normal rank

Latest revision as of 16:56, 8 July 2024

scientific article
Language Label Description Also known as
English
Subdifferential test for optimality
scientific article

    Statements

    Subdifferential test for optimality (English)
    0 references
    0 references
    0 references
    3 July 2014
    0 references
    Let \(X\) be a real Banach space with topological dual \(X^*\) and let \(\partial f: X\rightrightarrows X^*\) be a general subdifferential mapping for a lower semicontinuous functions \(f\) with the following properties: 1. \(\partial f\) coincides with the usual convex subdifferential whenever \(f\) is convex, 2. \(\partial(f- x^*)(x)=\partial f(x)- x^*\) for every \(x\in X\) and \(x^*\in X^*\), 3. if \(\varphi\) is convex and \(f+\varphi\) admits a local minimum at \(\overline x\), then \(0\in\partial f(\overline x)+\partial\varphi(\overline x)\). The authors provide a first-order necessary and sufficient condition for optimality of lower semicontinuous functions in terms of this subdifferential. The proof is based on the so-called \(\varepsilon\)-enlargement of \(\partial f\) given by \[ \widetilde\partial_\varepsilon f(\overline x):= \{x^*_\varepsilon\in\partial f(x_\varepsilon):\| x_\varepsilon-\overline x\|\leq\varepsilon, |f(x_\varepsilon)- f(\overline x)|\leq\varepsilon, \langle x^*_\varepsilon, x_\varepsilon-\overline x\rangle\leq\varepsilon\} \] and its relation \(f'(\overline x;d)\leq \text{inf}_{\varepsilon>0}\sup\langle\widetilde\partial_\varepsilon f(\overline x), d\rangle\) to the lower Dini directional derivative \(f'(\overline x;\cdot)\) of \(f\). As a consequence of this result it can be pointed out that the subdifferential mapping \(\partial f\) is in any case monotone absorbing, and hence maximal monotone if the function \(f\) is convex.
    0 references
    subdifferential
    0 references
    directional derivative
    0 references
    lower semicontinuous function
    0 references
    first-order optimality condition
    0 references
    maximal monotonicity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references