MétaCan
Menu
Back to cohort
Record W2898957569 · doi:10.1115/detc2018-85379

Advanced Primal-Dual Interior-Point Method for the Method of Moving Asymptotes

2018· article· en· W2898957569 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of CanadaGeneral Motors of Canada
KeywordsAsymptoteTopology optimizationMathematical optimizationDual (grammatical number)Point (geometry)Computer scienceInterior point methodTopology (electrical circuits)Optimization problemConvergence (economics)MathematicsFinite element methodEngineering

Abstract

fetched live from OpenAlex

The Method of Moving Asymptotes (MMA) is one of the well-known optimization algorithms for topology optimization due to its stable numerical performance. Here, this paper simplifies the MMA algorithm by considering the features of topology optimization problem statements and presents a strategy to solve the necessary subproblems based on the primal-dual-interior-point method to further enhance numerical performance. A new scaling mechanism is also introduced to improve searching quality by utilizing the sensitivities of the original problems at the beginning of each MMA iteration. Numerical examples of solving both mathematical problems and topology optimization problems demonstrate the success of this method.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.896
Threshold uncertainty score0.509

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
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.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.019
GPT teacher head0.344
Teacher spread0.325 · 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