MétaCan
Menu
Back to cohort
Record W1972168423 · doi:10.3934/jimo.2008.4.125

Canonical dual approach to solving 0-1 quadratic programming problems

2008· article· en· W1972168423 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

VenueJournal of Industrial and Management Optimization · 2008
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsDual polyhedronDuality gapDual (grammatical number)Duality (order theory)ConvexityMathematicsCanonical transformationQuadratic programmingConvex analysisStrong dualityCanonical formMathematical optimizationWolfe dualityPerturbation functionMinificationLinear programmingTransformation (genetics)Convex optimizationRegular polygonWeak dualityOptimization problemCombinatoricsPure mathematics

Abstract

fetched live from OpenAlex

By using the canonical dual transformation developedrecently, we derive a pair of canonical dual problems for 0-1quadratic programming problems in both minimization and maximizationform. Regardless convexity, when the canonical duals are solvable,no duality gap exists between the primal and corresponding dualproblems. Both global and local optimality conditions are given. Analgorithm is presented for finding global minimizers, even when theprimal objective function is not convex. Examples are included toillustrate this new approach.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.083
Threshold uncertainty score0.360

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.001
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.053
GPT teacher head0.237
Teacher spread0.185 · 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