MétaCan
Menu
Back to cohort

A Class of Nondifferentiable Multiobjective Control Problems

2013· article· en· W1800456984 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.

venuePublished in a venue whose home country is Canada.
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

VenueStudies in mathematical sciences · 2013
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsDuality (order theory)Multiobjective programmingClass (philosophy)Mathematical optimizationNonlinear systemDual (grammatical number)Type (biology)Applied mathematicsMulti-objective optimizationComputer sciencePure mathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

Optimality conditions are derived for a class of nondifferentiable multiobjective control problems having a nondifferentiable term in each component of vector-valued integrand of objective functional. Using Karush-Kuhn-Tucker type optimality conditions, we formulate Mond-Weir type dual to the nondifferentiable control problem and derive duality results extensively under generalized invexity. Finally, it is indicated that our duality results can be considered as dynamic generalizations of those of nondifferentiable nonlinear programming problems recently obtained.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.911
Threshold uncertainty score0.189

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.043
GPT teacher head0.315
Teacher spread0.272 · 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