- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies the complexity of recognizing three notions of signomial convexity: ordinary convexity, log-coordinate convexity, and log-log convexity. It establishes strong NP-hardness for all three notions, both on compact boxes and globally. The ordinary-convexity results follow directly from known polynomial-convexity hardness results. The main technical contributions concern the transformed notions: exponential approximations preserve curvature gaps, while coupled exponential auxiliary terms extend the constructions globally, preserve nonconvexity witnesses, and ensure positivity in the log-log case. The results are established through explicit polynomial-time reductions, supported by quantitative Hessian and log-curvature estimates, positivity guarantees, and polynomial bounds on the numerators and denominators of the rational input data.
Critical strengths
The main strength is establishing hardness of recognizing log-coordinate and log-log convexity, which does not follow directly from existing polynomial results. The reductions preserve curvature gaps under these transformations and extend to the global setting while ensuring positivity in the log-log case. These results clarify a fundamental limitation of automatic convexity recognition for signomials and are the main reason I support acceptance.
Critical weaknesses
None.
Questions for authors
I have no further clarification questions that would materially affect my current assessment.
We thank the reviewer for the careful reading, positive assessment, and recognition of our technical contributions.