MétaCan
Menu
Back to cohort
Record W2118402430 · doi:10.1109/cdc.1994.411006

Necessary conditions for bilevel dynamic optimization problems

2002· article· en· W2118402430 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsBilevel optimizationMathematical optimizationConstraint (computer-aided design)Optimization problemVariable (mathematics)Bellman equationMathematicsHierarchyUpper and lower boundsOptimal controlControl variablePerturbation (astronomy)Function (biology)Computer science

Abstract

fetched live from OpenAlex

Studies the bilevel dynamic optimization problem, which is a hierarchy of two optimization problems where the constraint region of the upper level problem is determined implicitly by the solution to the lower level problem and where the upper level decision variable is a vector while the lower level decision variable is an admissible control function. To obtain optimality conditions, the author reformulates the bilevel dynamic optimization problem as a single level optimal control problem which involves the value function of the lower level problem. Sensitivity analysis of the lower level problem with respect to the perturbation in the upper level decision variable is given and first order necessary optimality conditions are derived by using nonsmooth analysis.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: Methods
Teacher disagreement score0.156
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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
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.025
GPT teacher head0.249
Teacher spread0.224 · 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

Quick stats

Citations2
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicOptimization and Variational AnalysisFrench-language works237,207