MétaCan
Menu
Back to cohort
Record W2963803091 · doi:10.1137/16m1082172

The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau

2017· article· en· W2963803091 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueSIAM Journal on Optimization · 2017
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsUniversity of British Columbia, Okanagan CampusUniversity of British Columbia
FundersDivision of Mathematical SciencesNatural Sciences and Engineering Research Council of CanadaCanada Research ChairsPacific Institute for the Mathematical Sciences
KeywordsMathematicsResolventRegular polygonQuotientConvex functionBinary relationConvex setConnection (principal bundle)Pure mathematicsBijectionOrder (exchange)CombinatoricsDiscrete mathematicsConvex optimization

Abstract

fetched live from OpenAlex

We introduce and investigate the resolvent order, which is a binary relation on the set of firmly nonexpansive mappings. It unifies well-known orders introduced by Loewner (for positive semidefinite matrices) and by Zarantonello (for projectors onto convex cones). A connection with Moreau's order of convex functions is also presented. We also construct partial orders on (quotient sets of) proximal mappings and convex functions. Various examples illustrate our results.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.920
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0020.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.006
GPT teacher head0.229
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it