Solving Algorithm NCL’s Subproblems: The Need for Interior Methods
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
Abstract Algorithm NCL was devised to solve a class of large nonlinearly constrained optimization problems whose constraints do not satisfy LICQ at a solution. It is mathematically equivalent to the augmented Lagrangian algorithm LANCELOT, which solves a short sequence of bound-constrained subproblems $$\text {BC}_k$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mtext>BC</mml:mtext> <mml:mi>k</mml:mi> </mml:msub> </mml:math> and has no LICQ difficulties. NCL’s equivalent subproblems $$\text {NC}_k$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mtext>NC</mml:mtext> <mml:mi>k</mml:mi> </mml:msub> </mml:math> are much bigger and must be solved by a nonlinear interior method (needing first and second derivatives). We study the KKT-type systems arising within nonlinear interior methods when they are applied to the $$\text {NC}_k$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mtext>NC</mml:mtext> <mml:mi>k</mml:mi> </mml:msub> </mml:math> subproblems. We find that the KKT systems can sometimes be reduced to smaller SQD systems (symmetric quasi-definite) and sometimes to even smaller SPD systems (symmetric positive definite). The smaller systems have proved suitable for GPU implementation within the interior solver MadNLP when it is used by MadNCL to implement Algorithm NCL.
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.005 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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