- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper studies when to use reduced-space (RS) or full-space (FS) methods for equality-constrained optimization. It argues that the singular values of the state constraint Jacobian explain their different behavior: small singular values hurt RS, while very large ones hurt FS. The paper presents three theorems, a solver-selection rule, and four optimization examples.
Critical strengths
- The choice between RS and FS is a useful practical question. Separating the effects of very small and very large singular values is a clear way to study it.
- The experiments cover different problem types and report both solver outcomes and conditioning measurements.
Critical weaknesses
- Theorem 4.1 assumes that every singular vector has a nonzero projection onto every design direction. With two or more design variables, one can choose a nonzero direction whose projection is zero, so this assumption cannot hold as stated. The bound in Theorem 4.2 also appears false under its written assumptions. For example,
Questions for authors
-
How can the projection assumption hold for every design direction when there is more than one design variable? Can the RS conclusion be proved under an assumption that applies to your benchmarks?
-
Does the counterexample above violate an assumption that is missing from the theorem? If so, please state it. Otherwise, how should the bound in Equation 8 be corrected?
-
If the same constraints are multiplied by a constant or normalized, does the recommendation change? How should users choose and in practice?
Withdrawal Message
We thank the reviewers for their comments. Upon carefully considering the reviews, we realized that the technical presentation of our paper may be overly demanding, to the extent that readers might need to rely on LLMs to fully understand some of the content. We provide several examples below to illustrate this point:
This is a fundamental concept in linear algebra. As stated in the Wikipedia entry on matrix conditioning: "A matrix with a low condition number is said to be well-conditioned."
This is precisely why we evaluate RS and FS with different numbers of optimization variables. We would like to clarify that, for a given optimization problem, the singular values of the equality-constraint Jacobian are intrinsic quantities and cannot be arbitrarily adjusted. Rather, they can only be influenced indirectly through changes to the problem formulation, such as varying the number of optimization variables.
We recognize that this distinction may not be immediately apparent, particularly when relying on LLM-based interpretations, which may fail to distinguish between intrinsic numerical properties of an optimization problem and independently controllable variables. This may explain the concern raised in this question.
Under Assumptions 1 and 3 (lines 121–128), the Hessian matrix B is required to be positive definite. The matrix BB in your example does not satisfy this essential assumption.
This distinction is critical. As defined in lines 857–858, μmin is indeed min∣v∣=1vTBv, which coincides with σmin(B) when B is positive-definite. However, in your example, we have μmin=−9 which is negative. Consequently, dividing both sides of the inequality by μmin reverses the inequality direction. The resulting inequality becomes trivial: it merely states that the condition number of the KKT matrix is greater than some negative number, which is automatically true.
We understand that connecting a theorem to its underlying assumptions requires careful consideration of the preceding technical details. The counterexample in your question appears to overlook these assumptions, which may explain the issue.
We agree that scaling equality constraints can sometimes be beneficial for full-space methods, and that numerical solvers such as IPOPT and SNOPT provide built-in options for this purpose. However, constraint scaling does not offer the same benefit for reduced-space methods. In particular, the reduced-space Jacobian Jx−1Ju remains unchanged when both Jx and Ju are multiplied by the same nonzero constant.
We would also like to reiterate the central message of this paper: to demonstrate the fundamentally different behaviors of reduced-space and full-space methods as the equality-constraint Jacobian Jx becomes increasingly ill-conditioned. Algorithm 1 is intended primarily as a conceptual framework for guiding the selection between the two formulations, rather than as a directly implementable algorithm. This is also why we have placed it in the Appendix, rather than presenting it as a primary algorithmic contribution.
We recognize that capturing the overall scope and central message of a technically involved paper can be challenging, particularly when the assessment focuses disproportionately on individual details without considering their broader context. Nevertheless, we remain willing to clarify any aspects of the paper that the reviewer would like to understand further.
We recognize that further responses to the questions raised may not meaningfully change the outcome of the review. Therefore, we have decided to withdraw the paper, also in the interest of reducing the AC's workload. In retrospect, we may have overestimated the level of technical familiarity of the intended audience. We will instead submit the work to another venue where we hope its technical contributions can be evaluated more directly and independently, based on their merits.