- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper warm-starts IPOPT on a parametric family of NLPs using the stored IPM trajectory of a previously solved reference instance. A selection module picks one iterate of the reference trajectory using a Gumbel-Softmax over scores computed from the two parameter vectors. An adjustment module then predicts a dual-slack correction, recovers the primal and equality-dual corrections with a few L-BFGS steps on the KKT residual, and is trained with a loss that pushes the complementarity products toward a central-path neighborhood ( or ). Under optimization assumptions on the training loss, the paper shows that the trained outputs are strictly interior and central on the training instances, and that enough recovery steps place them in the prescribed neighborhood. On synthetic convex and nonconvex QPs, QCQPs, and SOCPs with 1,000 variables, WSNet reduces IPOPT iterations by up to 60% and total time, including inference, by up to 60%.
Critical strengths
-
A neat idea that respects how IPMs work. Primal-only learned warm starts, such as the DC3 and FSNet baselines here, do not control interiority or centrality. This paper builds a full primal-dual point and trains it directly for both, which is what an IPM needs. Reusing the reference trajectory is simple and effective: Fig. 3 and Fig. 6 show that an intermediate iterate is a better warm start than the final one, and the selection module learns to pick one.
-
Gains hold end to end. The total time in Table 1 includes inference. WSNet improves on cold-start IPOPT in all six problem classes and has the lowest total time in five of them. The selection-only ablation (AttNet) shows that the adjustment step matters, and Fig. 4 shows on convex SOCPs that each loss produces the intended complementarity structure.
Critical weaknesses
-
The benchmarks are synthetic and narrow.
- All six classes use random data, and only the right-hand side of the equality constraints varies with the parameter (, App. A). In the nonconvex classes, nonconvexity comes only from a term in the objective, and the constraints stay convex. These may be easy instances for trajectory reuse.
- Problem families from applications, for example model predictive control, portfolio optimization, or optimal power flow with nonconvex constraints, would show whether the gains carry over to the settings that motivate the paper (l. 33–36).
- The comparison misses the closest learned primal-dual warm start, IPM-LSTM (Gao et al., 2024), which the paper cites (l. 139). It also lacks a simple non-learned baseline that always picks a fixed trajectory iterate, tuned on the validation set.
- The comparison also lacks a non-learned warm start that targets centrality, such as the smoothing approach of Chen et al. (2025), which the paper cites (l. 131) and which applies directly to the convex QP and SOCP classes.
-
The theory assumes most of what it proves, and differs from the implementation.
- Assumption (A2) requires zero attainable loss and a PL-type condition over the whole training region, and (A4) requires zero attainable KKT residual. Under these, Theorem 5.1 is the standard SGD convergence argument under PL plus Markov's inequality.
- The guarantees hold only on training instances; the conclusion acknowledges that generalization is not covered (l. 483–484).
- The analysis uses gradient descent with step for recovery (App. D.2), while the method uses 50 L-BFGS steps (App. C.1).
Questions for authors
-
Recovery steps in Corollary 5.2. The corollary chooses the number of recovery steps large enough after training. Theorem 5.1 bounds the complementarity of the output produced with the used during training. Is the same in both? If not, how does the bound of Theorem 5.1 carry over?
-
IPOPT settings. How is the warm start passed to IPOPT (e.g.,
warm_start_init_point,mu_init, bound push options), and which linear solver is used? Is the cold start IPOPT's default initialization? Suri et al. (2026), which the paper cites, argue that the cold-start baseline strongly affects reported warm-start gains. Also, a cold-start time of 32 s for a 1,000-variable QP (Table 1) seems high. -
Reference instance and trajectory length. Is fixed, or sampled per instance (App. B.1 says it is sampled from during training)? The selection matrix assumes a fixed trajectory length . How are reference trajectories of different lengths handled?
-
Interpretability. As written in Eq. (5), the selection scores are linear in . Can the learned selection rule be interpreted, for example as a function of ? Fig. 6 suggests that it picks advanced but nonterminal iterates, and a simple description/interpretation/plot of this rule would be useful.
Minor:
- The paper calls the instances "perturbed", which suggests small changes to a nominal problem. Here both and are drawn from (App. B.1), so "parametric" describes the setting better.
- The selection module is called "attention-based", but Eq. (5) is a linear layer followed by Gumbel-Softmax. Please clarify where attention enters.
4 comments
W5. The comparison also lacks a non-learned warm start that targets centrality, such as the smoothing approach of Chen et al. (2025), which the paper cites (l. 131) and which applies directly to the convex QP and SOCP classes.
We have added a comparison with the smoothing-based warm-starting method of Chen et al. [6], denoted as Smoothing, on the convex QP, MOSARQP2, and MPC benchmarks. The results below report IPOPT iteration reduction / end-to-end total-time reduction relative to cold-start IPOPT, with total time including initialization.
| Method | Convex QP | MOSARQP2 | MPC |
|---|---|---|---|
| Smoothing | 17.2% / 33.8% | 39.7% / 46.1% | 23.5% / 33.3% |
| WSNet$_{-\infty}$ | 49.8% / 52.0% | 54.4% / 53.4% | 57.9% / 40.8% |
| WSNet$_2$ | 45.5% / 53.7% | 57.9% / 56.6% | 57.8% / 41.3% |
- WSNet consistently achieves substantially larger iteration reductions than Smoothing across all three benchmarks. More importantly, it provides the best total-time reduction on Convex QP, MOSARQP2, and MPC—up to 53.7%, 56.6%, and 41.3%, respectively—despite including its initialization cost.
Detailed results and further analysis are provided in Appendix B.3.
W6. Assumption (A2) requires zero attainable loss and a PL-type condition over the whole training region, and (A4) requires zero attainable KKT residual. Under these, Theorem 5.1 is the standard SGD convergence argument under PL plus Markov's inequality.
Thank you for this comment.
- We acknowledge that these assumptions are a little bit restrictive. (A2) requires an arbitrarily small attainable training loss and a PL-type condition, which is not guaranteed for general neural networks. (A4) assumes that recovery residuals can be made arbitrarily small; it does not assert that finite-step recovery achieves zero residual.
- We agree that the SGD convergence argument uses standard PL analysis and Markov’s inequality. The role of our analysis is to connect training-loss and recovery-residual bounds to sufficient conditions for strict interiority and membership in the prescribed central-path neighborhood.
These are conditional guarantees rather than a complete explanation of practical performance. We state the assumptions in Section 5 and acknowledge their limitations in the Conclusion of the revised manuscript.
W7. The guarantees hold only on training instances; the conclusion acknowledges that generalization is not covered (l. 483–484).
Thanks for raising this. Our theoretical guarantees apply only to training instances, while generalization is evaluated empirically on held-out instances and under broader parameter distributions (Appendix B.4). Establishing generalization guarantees remains an important direction for future work, as noted in the conclusion.
W8. The analysis uses gradient descent with step for recovery (App. D.2), while the method uses 50 L-BFGS steps (App. C.1).
Thank you for pointing out this distinction. Our recovery convergence analysis considers GD under the stated assumptions. On the synthetic benchmarks, we use 50 L-BFGS steps to align the recovery method with FSNet. On the public benchmarks, we use five GD steps to reduce recovery overhead.
We additionally compare 50-step GD and 50-step L-BFGS recovery for WSNet$_2$ on the convex QCQP benchmark with 1,000 variables, 500 inequality constraints, and 500 equality constraints. As shown below, GD reduces prediction time from 1.643 s to 0.051 s and still achieves a 36.49% reduction in total solution time relative to cold-start IPOPT. L-BFGS provides stronger warm-start gains and a lower total solution time on this benchmark.
| Method | End-to-End | IPOPT (warm start) | Total Time (s) ↓ | Gain (Ite./Time) ↑ | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Obj. ↓ | Max ineq. ↓ | Mean ineq. ↓ | Max eq. ↓ | Mean eq. ↓ | Time (s) ↓ | Ite. ↓ | Time (s) ↓ | |||
| IPOPT | −186.986 | 0.000 | 0.000 | 0.000 | 0.000 | 90.632 | 13.18 | — | — | — |
| WSNet$_2$ (L-BFGS50) | −185.823 | 0.006 | 0.000 | 0.002 | 0.001 | 1.643 | 6.92 | 48.441 | 50.084 | 47.50%/44.74% |
| WSNet$_2$ (GD50) | −185.732 | 0.005 | 0.000 | 0.007 | 0.002 | 0.051 | 7.78 | 57.511 | 57.562 | 40.97%/36.49% |
Questions For Authors
Q1. Recovery steps in Corollary 5.2. The corollary chooses the number of recovery steps large enough after training. Theorem 5.1 bounds the complementarity of the output produced with the used during training. Is the same in both? If not, how does the bound of Theorem 5.1 carry over?
Thank you for pointing out this issue. We use the same recovery budget during training and inference. The loss in Theorem 5.1 is evaluated on the output of this same finite-step recovery map .
Q2. IPOPT settings. How is the warm start passed to IPOPT (e.g., warm_start_init_point, mu_init, bound push options), and which linear solver is used? Is the cold start IPOPT's default initialization? Suri et al. (2026), which the paper cites, argue that the cold-start baseline strongly affects reported warm-start gains. Also, a cold-start time of 32 s for a 1,000-variable QP (Table 1) seems high.
Thank you for raising this point.
- We have added the detailed IPOPT settings to Appendix C.1, including the initialization procedure and warm-start parameters.
- The relatively long solve time for the 1,000-variable QPs is largely due to the dense structure of these synthetic instances, which increases the computational cost of each IPOPT iteration.
Q3. Reference instance and trajectory length. Is fixed, or sampled per instance (App. B.1 says it is sampled from during training)? The selection matrix assumes a fixed trajectory length . How are reference trajectories of different lengths handled?
For each problem class, is sampled once and held fixed throughout training, validation, and testing. Its stored IPM trajectory of length is reused to warm-start many related instances. Both the reference trajectory and are therefore fixed before training. In our current setup, changing the reference instance requires training a corresponding model; if changes, the selector’s output dimension is adjusted accordingly.
Q4. Interpretability. As written in Eq. (5), the selection scores are linear in . Can the learned selection rule be interpreted, for example as a function of ? Fig. 6 suggests that it picks advanced but nonterminal iterates, and a simple description/interpretation/plot of this rule would be useful.
Thank you for this suggestion. With fixed, the scores in Eq. (5) are affine functions of , allowing the selector to distinguish parameter changes in different directions rather than relying solely on their magnitude. The selection rule is learned jointly with the adjustment module through the centrality loss evaluated after recovery.
Figure 6 suggests that the selector balances progress toward the reference solution against interiority, favoring advanced but nonterminal iterates. This interpretation is consistent with Appendix E.1: the contextual residual bound contains a term proportional to , so later iterates with smaller barrier parameters can be more sensitive to parameter changes.
Minor:
Q5. The paper calls the instances "perturbed", which suggests small changes to a nominal problem. Here both and are drawn from (App. B.1), so "parametric" describes the setting better.
Thanks for your suggestion. We agree that “parametric” more precisely describes the synthetic setting, where is sampled independently of the fixed reference . We have revised the terminology throughout the manuscript, using “parametric problem families” for the overall setting and “target instance” for the instance to be solved. The newly added public benchmarks use independent perturbations of selected parameter coordinates around the nominal , as detailed in Appendix A.2.
Q6. The selection module is called "attention-based", but Eq. (5) is a linear layer followed by Gumbel-Softmax. Please clarify where attention enters.
The selection module is inspired by the attention mechanism in GAT [5], which computes learned scores from concatenated features and uses normalized weights for aggregation. We adapt this idea to a fixed reference trajectory: Eq. (5) computes iterate-specific scores from , and Eq. (6) applies the resulting weights to the stored primal–dual iterates and barrier parameters. Our simplified design omits the LeakyReLU activation and replaces softmax with Gumbel–Softmax to support discrete selection during gradient-based training.
References
[1] István Maros and Csaba Mészáros. A repository of convex quadratic programming problems. Optimization Methods and Software, 11(1–4):671–681, 1999. doi:10.1080/10556789908805768.
[2] Jeffrey Ichnowski, Paras Jain, Bartolomeo Stellato, Goran Banjac, Michael Luo, Francesco Borrelli, Joseph E. Gonzalez, Ion Stoica, and Ken Goldberg. Accelerating quadratic optimization with reinforcement learning. In Advances in Neural Information Processing Systems, 34:21043–21055, 2021.
[3] Priya L. Donti, David Rolnick, and J. Zico Kolter. DC3: A learning method for optimization with hard constraints. In International Conference on Learning Representations, 2021.
[4] Xi Gao, Jinxin Xiong, Akang Wang, Qihong Duan, Jiang Xue, and Qingjiang Shi. IPM-LSTM: A learning-based interior point method for solving nonlinear programs. In Advances in Neural Information Processing Systems, 37:122891–122916, 2024.
[5] Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. Graph attention networks. In International Conference on Learning Representations, 2018.
[6] Yuwen Chen, Paul Goulart, and Colin Jones. A warmstarting technique for general conic optimization in interior point methods. arXiv preprint arXiv:2512.00693, 2025.
We sincerely appreciate the reviewer’s effort and positive feedback. Revisions in the manuscript are highlighted in blue. Below, we address the concerns and questions raised.
Critical Weaknesses
Thank you for this suggestion. We have added MOSARQP2, a standard convex QP from the Maros–Mészáros repository [1], together with two real-world benchmarks (as suggested): MPC for model predictive control from RLQP [2] and ACOPF for power-system generation dispatch used in DC3 [3].
The new benchmarks are introduced in Section 6.1, with results in Table 1 and analysis in Section 6.2. Their formulations and data-generation procedures are detailed in Appendix A.2.
Thanks for mentioning this.
The detailed results are reported in Appendix B.2 of the revised manuscript.
Thank you for the suggestion. This baseline is a special case of AttNet: choosing one fixed iterate corresponds to using a constant, one-hot attention vector for every target instance. AttNet instead selects an iterate adaptively for each instance, since the most suitable reference iterate may vary with the problem parameters.