MétaCan
Menu
Back to cohort
Record W4248891727 · doi:10.1080/00036811.2014.890710

Differential stability of convex optimization problems under inclusion constraints

2014· article· en· W4248891727 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueApplicable Analysis · 2014
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsnot available
FundersUniversity of Windsor
KeywordsSubderivativeMathematicsConvexityDifferential inclusionParametric statisticsMathematical optimizationFunction (biology)Nonlinear programmingParametric programmingConvex analysisStability (learning theory)Convex optimizationRegular polygonNonlinear systemComputer science

Abstract

fetched live from OpenAlex

AbstractMotivated by the recent work of Mordukhovich et al. [Subgradients of marginal functions in parametric mathematical programming. Math. Program. Ser. B. 2009;116:369–396] on the optimal value function in parametric programming under inclusion constraints, this paper presents some new results on differential stability of convex optimization problems under inclusion constraints and functional constraints in Hausdorff locally convex topological vector spaces. By using the Moreau–Rockafellar theorem and appropriate regularity conditions, we obtain formulas for computing the subdifferential and the singular subdifferential of the optimal value function. By virtue of the convexity, several assumptions used in the above paper by Mordukhovich et al., like the nonemptyness of the Fréchet upper subdiffential of the objective function, the existence of a local upper Lipschitzian selection of the solution map, as well as the -inner semicontinuity and the -inner semicompactness of the solution map, are no longer needed. Relationships between our results and the corresponding ones in Aubin's book [Optima and equilibria. An introduction to nonlinear analysis. 2nd ed. New York (NY): Springer; 1998] are discussed.Keywords: parametric programming under inclusion constraintsconvexityoptimal value functionsubdifferentialsingular subdifferentialthe Moreau–Rockafellar theoremnormal cone to the sublevel set of a convex functionAMS Subject Classifications: 49J5349Q1290C2590C31 AcknowledgmentsVery useful comments of Professor Le Dung Muu and the anonymous referee on earlier versions of this paper are gratefully acknowledged.NotesDedicated to Professor Boris Sholimovich Mordukhovich on the occasion of his sixty-fifth birthday.2 Supplemental data for this article can be accessed http://dx.doi.org/10.1080/00036811.2014.890710.The research of Duong Thi Viet An was supported by College of Sciences, Thai Nguyen University. The research of Nguyen Dong Yen was supported by the National Foundation for Science & Technology Development (Vietnam) under [grant number 101.02-2011.01].

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
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.930
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.011
GPT teacher head0.222
Teacher spread0.211 · 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