Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T01:08:05.064Z Has data issue: false hasContentIssue false

Proto-Differentiation of Subgradient Set-Valued Mappings

Published online by Cambridge University Press:  20 November 2018

René A. Poliquin*
Affiliation:
University of Alberta Edmonton, Alberta
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Set-valued mappings arise quite naturally in optimization and nonsmooth analysis. In optimization, typically one has a family of optimization problems that depend on some parameter. One can then associate to this family of problems the set-valued mappings that assign to the parameter the set of optimal solutions, the set of feasible solutions or the set of multipliers. Many of these set-valued mappings encountered in optimization have been shown to be “proto-differentiable” (see Rockafellar [16]) i.e., in some sense these set-valued mappings are “differentiable”. Using estimates provided by the proto-derivatives, see Proposition 2.1, one can then obtain information on how the sets depend on the parameter. The concept of proto-differentiation is described in Section 2.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1990