A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs
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
This paper makes a survey on SOC complementarity functions and related solution methods for the second-order cone programming (SOCP) and second-order cone complementarity problem (SOCCP). Specifically, we discuss the properties of four classes of popular merit functions, and study the theoretical results of associated merit function methods and numerical behaviors in the solution of convex SOCPs. Then, we present suitable nonsinguarity conditions for the B-subdifferentials of the natural residual (NR) and Fischer-Burmeister (FB) nonsmooth system reformulations at a (locally) optimal solution, and test the numerical behavior of a globally convergent FB semismooth Newton method. Finally, we survey the properties of smoothing functions of the NR and FB SOC complementarity functions, and provide numerical comparisons of the smoothing Newton methods based on them. The theoretical results and numerical experience of this paper provide a comprehensive view on the development of this field in the past ten years.
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.003 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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