MétaCan
Menu
Back to cohort
Record W2298639746 · doi:10.14288/1.0050419

A level set global optimization method for nonlinear engineering problems

2009· article· en· W2298639746 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

VenueOpen Collections · 2009
Typearticle
Languageen
FieldEngineering
TopicWater resources management and optimization
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsSet (abstract data type)Nonlinear programmingNonlinear systemComputer scienceMathematical optimizationPoint (geometry)Reliability (semiconductor)Convergence (economics)Function (biology)MathematicsProgramming language

Abstract

fetched live from OpenAlex

The mathematical equations used in civil engineering design procedures are predomi nantly nonlinear. Most civil engineering design optimization problems would therefore require the use of nonlinear programming (NLP) techniques for their solution. Those NLP packages with the ability to handle practical sizes of problems, and have been available on mainframe computers for many years, are only now becoming available on microcomputers. On top of this, these existing NLP techniques, which are dominated by the gradient methods, do not guarantee global solutions. As a consequence suitable optimization methods for civil engineering design are not being enjoyed by practitioners. In this thesis, the level set optimization method, whose theory was initially presented in “Integral global optimization” by [Chew & Zheng, 1988] was further developed to address, in particular, practical engineering problems. It was found that Level Set Pro gramming (LSP), offers a viable alternative to existing nonlinear optimization methods. While LSP does not radically alter the computational effort involved it has some unique characteristics which appear to be significant from the engineering users point of view. LSP which is classified as a direct search method of optimization, utilizes the set theory concept of a level set. It uses estimates of moments of the objective function values at the confirmed points within a level set to control the search advance and as a measure of convergence on the global optimum. The reliability and efficiency of LSP was verified by comparing its results with pub lished results for both mathematical and engineering test problems. In addition to the published test problems, a new parametrically adjustable mathematical test problem was designed to test global optimization methods in general and to explore the strengths and weaknesses of LSP in particular. Experience with these test problems showed that LSP gave similar results to those cited in the literature as well as improved results or more complete sets of global solution. The large number of solutions developed at each iteration of LSP permits meaningful graphical displays of the progressive reduction in the level set boundaries as the global solution is approached. Other displays were also found to provide insights into the solution process and a basis for diagnosing search difficulties.

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.022
Threshold uncertainty score0.666

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.0010.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.029
GPT teacher head0.265
Teacher spread0.236 · 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