MétaCan
Menu
Back to cohort
Record W4226238011 · doi:10.23952/jnva.6.2022.1.01

Strong and total Lagrange dualities for quasiconvex programming

2022· article· en· W4226238011 on OpenAlexvenueno aff
Donghui Fang, Ting Yang, Yeong‐Cheng Liou

Bibliographic record

VenueJournal of Nonlinear and Variational Analysis · 2022
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsnot available
FundersNatural Science Foundation of Hunan ProvinceNational Natural Science Foundation of China
KeywordsQuasiconvex functionMathematicsComputer scienceGeometryConvex analysisConvex optimizationRegular polygon

Abstract

fetched live from OpenAlex

In this paper, we present the strong and total Lagrange dualities for quasiconvex programming in real locally convex Hausdorff topological vector spaces. By using the epigraphs, subdifferential and generators of involved functions, we introduce some new constraint qualifications. Under these new constraint qualifications, we establish sufficient and necessary conditions to characterize the strong and total Lagrange dualities for quasiconvex programming.

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.003
metaresearch head score (Gemma)0.005
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: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.005
Open science0.0010.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0070.001

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.017
GPT teacher head0.263
Teacher spread0.246 · 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
GenreMethods

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

Citations4
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Nonlinear and Variational AnalysisSame topicOptimization and Variational AnalysisFrench-language works237,207