Solving indefinite quadratic programs by dynamical systems: Preliminary investigations
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.
Bibliographic record
Abstract
Preliminary results of our investigations on solving indefinite quadratic programs by dynamical systems are given.First, dynamical systems corresponding to two fundamental DC programming algorithms to deal with indefinite quadratic programs are considered.Second, the existence and the uniqueness of the global solution of the dynamical system are proved by using some theorems from nonsmooth analysis and the theory of ordinary differential equations.Third, the strong pseudomonotonicity of the restriction of an affine operator on a closed convex set is analyzed in a special case.Finally, for a parametric indefinite quadratic program related to that special case, convergence of the trajectories of the dynamical system to the Karush-Kuhn-Tucker points is established.The elementary direct proofs in the third and fourth topics would be useful for understanding the meaning and significance of several open problems proposed in this paper.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it