A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems
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
The alternating direction method of multipliers (ADMM) is a powerful method to solve constrained convex optimization problems with the separable structure. The ADMM with the positiveindefinite proximal terms, which has ergodic convergent rate O( 1 K ) with the number of iterations K, is more general than the ADMM with positive-definite proximal terms. In this paper, we propose a new accelerated positive-indefinite proximal linearized ADMM algorithm with positive-indefinite proximal matrix by the techniques of extrapolation. We obtain the nonergodic convergence rate O( 1 K ) in the sense of objective values and the nonergodic convergence rate O( 1 K ) in the sense of iterative sequence of the proposed method as well as the upper bound of the violation of constraints. Numerical results are reported to show the efficiency of the proposed method.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 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