RECORD
Formulae for the Conjugate and the Subdifferential of the Supremum Function
Optimization and Control · Submitted 26 Dec 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim However, we show how to extend these results to arbitrary locally convex spaces without any qualification condition.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
The aim of this work is to provide formulae for the subdifferential and the conjungate function of the supremun function over an arbitrary family of functions. The work is principally motivated by the case when data functions are lower semicontinuous proper and convex. Nevertheless, we explore the case when the family of functions is arbitrary, but satisfying that the biconjugate of the supremum functions is equal to the supremum of the biconjugate of the data functions. The study focuses its attention on functions defined in finite-dimensional spaces, in this case the formulae can be simplified under certain qualification conditions. However, we show how to extend these results to arbitrary locally convex spaces without any qualification condition.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The aim of this work is to provide formulae for the subdifferential and the conjungate function of the supremun function over an arbitrary family of functions. | contribution 0.99 | 0.78 | 0.26 | asserted 0.93 |
| s1 | The work is principally motivated by the case when data functions are lower semicontinuous proper and convex. | background 0.96 | 0.29 | 0.04 | asserted 1.00 |
| s2 | Nevertheless, we explore the case when the family of functions is arbitrary, but satisfying that the biconjugate of the supremum functions is equal to the supremum of the biconjugate of the data functions. | contribution 0.96 | 0.88 | 0.09 | asserted 0.97 |
| s3 | The study focuses its attention on functions defined in finite-dimensional spaces, in this case the formulae can be simplified under certain qualification conditions. | limitation 0.57 | 0.66 | 0.06 | asserted 0.88 |
| s4 | However, we show how to extend these results to arbitrary locally convex spaces without any qualification condition. | contribution 0.67 | 0.94 | 0.23 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
The aim of this work is to provide formulae for the subdifferential and the conjungate function of the supremun function over an arbitrary family of functions. The work is principally motivated by the case when data functions are lower semicontinuous proper and convex. Nevertheless, we explore the case when the family of functions is arbitrary, but satisfying that the biconjugate of the supremum functions is equal to the supremum of the biconjugate of the data functions. The study focuses its attention on functions defined in finite-dimensional spaces, in this case the formulae can be simplified under certain qualification conditions. However, we show how to extend these results to arbitrary locally convex spaces without any qualification condition.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.