MétaCan
Menu
Back to cohort
Record W2126636640

O(m) Bound on Number of Iterations in Sphere Methods for LP

2012· article· en· W2126636640 on OpenAlexvenueno aff
Katta G. Murty

Bibliographic record

VenueAlgorithmic operations research · 2012
Typearticle
Languageen
FieldMathematics
TopicAdvanced Optimization Algorithms Research
Canadian institutionsnot available
Fundersnot available
KeywordsMathematical proofMathematicsMatrix (chemical analysis)Subject (documents)CombinatoricsDiscrete mathematicsApplied mathematicsComputer scienceGeometry
DOInot available

Abstract

fetched live from OpenAlex

Consider the linear program (LP): minimize z= cx, subject to Axb, where A is an mn matrix. Sphere methods (SMs) for solving this LP were introduced in Murty (5, 6), eve n though this name was not used there. Theorems in those papers claimed that a version of this method needs at mo st O(m) iterations to solve this LP, however Mirzaian (2) pointed out an error in the proofs of these theorems there . Here we prove the claim using the geometry of inspheres. Also the results in this paper provide a solution to the speci al case of the open problem 2 in page 441 of the book Murty (7) dealing only with inspheres encountered in the SM.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.033
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.020
Threshold uncertainty score0.067

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.033
Meta-epidemiology (narrow)0.0040.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0020.007
Open science0.0030.005
Research integrity0.0020.008
Insufficient payload (model declined to judge)0.0200.005

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.266
GPT teacher head0.609
Teacher spread0.343 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueAlgorithmic operations researchSame topicAdvanced Optimization Algorithms ResearchFrench-language works237,207