- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
FlexCone replaces hard cone constraints with blockwise cone-distance penalties based on the type of cones, and applies an ADMM splitting in which the cone projection becomes a proximal update. For infeasible problems, the penalized solution trades objective value against constraint violation; scaling the penalties drives the violation toward its minimum. The method also keeps its updated dual iterates bounded, and supports learned warm starts and algorithm parameters through unrolling.
Critical strengths
- The conic distance penalty gives a clean way to return useful points when subproblems are infeasible, without enlarging the optimization problem.
- The applications show practical benefits in extended numerical experiments, supported by a clear analysis of the penalized solver.
Critical weaknesses
- The experiments rely heavily on COSMO variants. Comparisons with a broader range of methods for handling infeasible conic subproblems would make the practical advantage more convincing. The benefit of the learned policy on infeasible instances also remains unclear.
- The residual discussion incorrectly equates satisfaction of the penalized KKT conditions with zero original-cone violation. This matters precisely in the infeasible regime the paper aims to address.
Minor concerns: the assumptions should distinguish Slater's condition from primal attainment: Slater alone does not guarantee that an optimizer, and hence a KKT point, exists. It only guarantees strong duality/KKT when a finite optimal value exists.
Questions for authors
- Could the authors compare FlexCone with an existing conic PDHG solver on the original feasible problems, at matched accuracy and hardware?
- On infeasible control subproblems, could they also compare against an elastic PDHG formulation under the same SCP loop and fallback policy?
Response to Reviewer z4m6
We thank the reviewer for the constructive feedback and for suggesting the PDHG comparisons, which we have now run.
W1 / Q1 - Conic PDHG on the feasible benchmarks
We benchmarked against PDCS and PDHCG, two GPU conic PDHG solvers, on the the same 20 instance benchmark as in Table 2. PDCS only supports second-order cones, so it was only run on the robust MPC and robust KF classes below. We also benchmarked against an interior-point method Clarabel for reference.
Median wall-clock time (s):
Learned FlexCone still provides a substantial benefit on the SDP classes and is 2-16$\times$ faster than PDHCG. Meanwhile, PDHCG and Clarabel are much faster on the small SOCPs. We have added these additonal benchmarks in the updated appendix.
W1 / Q2 - Elastic baselines in the SCP loop
We re-ran the closed-loop control experiments using COSMO, Clarabel, and PDHCG with an explicit ℓ1 slack formulation. PDHCG receives the same per-step compute as FlexCone and COSMO.
3-DoF powered descent:
Iterative covariance steering:
On powered descent, while Clarabel is the fastest solver overall, all the slack baselines have limited successes. Meanwhile, on iterative covariance steering, FlexCone achieves an 87% success rate with the fastest subproblem time and time to success. COSMO slacks and Clarabel slacks achieve high success rates but suffer from a slow solve time due to the size of the SDP subproblems. These results further support our claim that FlexCone provides a unique capability over existing/standard techniques.
W1 - Benefit of the learned policy on infeasible instances
We trained a policy on a 50/50 mix of feasible and infeasible certification systems and tested it on 388 held-out infeasible systems. At 300 iterations it brings 97.7% of them to within 1% of the minimum violation, against 89.2% for the best fixed setting. It reduces iterations to a certification verdict by about 1.2$\times$. However, it is about 4.5$\times$ slower in total wall-clock time, because it changes the step size at every iteration. We report this as a mixed result: the policy reduces iterations on infeasible instances but it does not yet reduce time.
W2 - Penalized KKT conditions and original-cone violation
The reviewer is correct. The sentence in Section 2.4 stating that the residual vanishes exactly at a penalized KKT point is wrong, since it includes the original cone violation. Satisfying the penalized conditions (Proposition 2.2) implies zero original-cone violation only when the problem is feasible and μ is large enough (Theorem 2.3). On an infeasible problem, the cone violation at the penalized solution is positive by construction. Our implementation applies the cone-violation term to feasible instances, and on infeasible instances the loss uses only the stationarity and penalized complementarity terms. We have corrected the text to match.
Minor: Slater's condition and attainment
We agree. We replaced the assumption with "the optimal value is finite and attained and a constraint qualification holds, so that a KKT point exists". Theorem 2.3a is already stated for a given KKT point and is unaffected.