{"id":"eefbc768-2c72-4b5f-aec0-3e47c7f7ccf4","arxiv_id":"2403.17241","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Proves finite convergence of the matrix Moment-SOS hierarchy under nondegeneracy, strict complementarity, and second-order sufficient conditions at minimizers, plus flat truncation detection, assuming the Archimedean property.","lead":"The paper proves finite convergence of the matrix Moment-SOS hierarchy for polynomial matrix optimization when nondegeneracy, strict complementarity, and second-order sufficient conditions hold at minimizers, assuming the Archimedean property. A smart generalist might read it to see how standard optimality conditions from nonlinear semidefinite programming guarantee exact finite-step solutions in matrix polynomial problems.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest_assumption correctly isolates the conditional nature of the result. Because the full proof text is referenced but yields no visible gap or circularity when the claim is read at face value, the skeptic pass raises no additional load-bearing concern and leaves the UNVERDICTED status unchanged.","tokens_in":1585,"tokens_out":267,"duration_ms":17882,"concrete_test":"Extract the statement of the main finite-convergence theorem and its proof; verify that the argument derives flat truncation directly from the three optimality conditions plus Archimedeanness without invoking any additional implicit regularity (e.g., on the spectrahedron or the moment cone) that is not listed in the hypotheses.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim asserts finite convergence of the matrix Moment-SOS hierarchy (and the flat-truncation property of minimizers) whenever the nondegeneracy, strict complementarity and second-order sufficient conditions hold at every minimizer, under the Archimedean assumption. These are precisely the standard second-order optimality conditions from nonlinear semidefinite programming; the abstract states the result as conditional on them. No internal inconsistency, hidden assumption, or unsupported step is detectable from the given statement of the theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper studies the matrix Moment-SOS hierarchy for polynomial matrix optimization. It claims two results: (1) finite convergence of the hierarchy (and the flat-truncation property) whenever the nondegeneracy condition, strict complementarity condition, and second-order sufficient condition hold at every minimizer, under the Archimedean assumption; (2) that every minimizer of the moment relaxation must have flat truncation for sufficiently large relaxation order under the same conditions. These are presented as connecting nonlinear semidefinite optimization theory to Moment-SOS methods.","tokens_in":1679,"tokens_out":390,"duration_ms":23466,"significance":"If the proofs hold, the results supply finite-convergence guarantees for the matrix Moment-SOS hierarchy under precisely the standard second-order optimality conditions of nonlinear SDP. This is a useful theoretical link that explains when the hierarchy terminates finitely and supplies a practical flat-truncation detection criterion. The work credits the Archimedean assumption and the three classical conditions without introducing new ad-hoc hypotheses.","major_comments":[],"minor_comments":[{"comment":"The abstract states the main theorem but the introduction or §2 should explicitly recall the precise statements of the nondegeneracy, strict complementarity, and SOSC conditions (with equation numbers) so that the reader can verify they match the cited nonlinear-SDP references.","section":null},{"comment":"Notation for the matrix polynomial, the moment matrix, and the localizing matrix should be introduced once in §2 with a single consistent symbol set; several symbols appear to be redefined across sections.","section":null},{"comment":"The statement of the flat-truncation result should include an explicit dependence on the relaxation order (e.g., “for all k ≥ K0”) rather than the informal phrase “when the relaxation order is big enough.”","section":null}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive assessment of the manuscript, the recognition of its theoretical contribution linking nonlinear SDP optimality conditions to the matrix Moment-SOS hierarchy, and the recommendation for minor revision. No specific major comments were raised.","responses":[],"tokens_in":1132,"tokens_out":64,"duration_ms":22827,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that this paper proves finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization when nondegeneracy, strict complementarity, and second-order sufficient conditions hold at every minimizer, under the Archimedean assumption. It also shows that the moment relaxations eventually produce minimizers with flat truncations under those same conditions, giving a practical detection criterion.","headline":"Finite convergence for the matrix Moment-SOS hierarchy under the usual nonlinear SDP second-order conditions, plus flat truncation detection.","tokens_in":2158,"tokens_out":145,"would_cite":false,"duration_ms":16647,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"Standard SDP hierarchy convergence under classical optimality conditions; no RS-shaped cost or forcing structure","alignment":"orthogonal","rationale":"The paper proves finite convergence of the matrix Moment-SOS hierarchy for polynomial matrix optimization when NDC/SCC/SOSC hold at minimizers and QM[G] is Archimedean, using Scheiderer's local-global principle (Theorem 2.5) and local SOS representations via Schur complements. Central objects are quadratic modules QM[G], flat truncation of moment matrices, and second-order conditions involving the H-term. These are standard tools from nonlinear semidefinite programming and real algebraic geometry. RS framework (IndisputableMonolith/Foundation/RealityFromDistinction, Cost/FunctionalEquation/washburn_uniqueness_aczel, Cost/Jcost) forces the reciprocal cost J(x) = ½(x + x⁻¹) − 1, φ-ladder, and 8-tick periodicity from a single distinction with zero adjustable parameters; the paper invokes no ratio-symmetric cost, no J-cost identities, and no parameter-free derivation of constants. Domain mismatch is complete.","tokens_in":66415,"confidence":"high","tokens_out":243,"duration_ms":11299,"cache_read_input_tokens":38528,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The Moment-SOS hierarchy for polynomial matrix optimization converges in finitely many steps when nondegeneracy, strict complementarity, and second-order sufficient conditions hold at every minimizer.","keywords":["polynomial matrix optimization","Moment-SOS hierarchy","finite convergence","flat truncation","moment relaxation","nonlinear semidefinite programming","Archimedean property"],"falsifier":"A polynomial matrix optimization problem that satisfies the Archimedean property, has the stated optimality conditions at its minimizers, yet produces moment relaxations whose optimal values keep improving with every increase in relaxation order without ever reaching the true minimum.","tokens_in":2483,"feed_emoji":"","tokens_out":701,"duration_ms":32041,"temperature":0.7,"pith_summary":"This paper shows that the matrix Moment-SOS hierarchy reaches the exact global minimum of a polynomial matrix optimization problem after finitely many steps. The finite termination occurs under the Archimedean property together with the nondegeneracy condition, strict complementarity condition, and second-order sufficient condition at each minimizer. Flat truncation of the moment matrix provides a practical certificate that the hierarchy has terminated exactly. The results tie classical optimality theory from nonlinear semidefinite programming to the construction of moment relaxations, so that exact solutions become available from a single finite semidefinite program rather than an infinite sequence.","feed_headline":"Moment-SOS hierarchy reaches exact optima in finite steps","feed_subtitle":"Nondegeneracy, strict complementarity and second-order conditions at minimizers plus the Archimedean property guarantee termination with a 4","key_machinery":"The flat truncation condition on the moment matrix in the matrix Moment-SOS hierarchy, which certifies that the relaxation has attained the exact optimal value.","core_discovery":"Under the Archimedean property, if the nondegeneracy condition, strict complementarity condition and second order sufficient condition hold at every minimizer, then the Moment-SOS hierarchy has finite convergence. Moreover, every minimizer of the moment relaxation must exhibit flat truncation once the relaxation order is large enough, and this flat truncation serves as a detection criterion for the finite convergence.","pith_inferences":["The same finite-convergence argument may apply to other polynomial optimization problems that admit a matrix-valued formulation.","When the optimality conditions fail at some minimizer, the hierarchy may still converge asymptotically but without a finite termination guarantee.","The flat truncation criterion offers a computational check that can be performed on any instance to decide whether the obtained relaxation is already exact.","The link between the two theories suggests that second-order sufficient conditions could be used to certify exactness in related hierarchies for scalar or vector polynomial problems."],"forward_implications":["Exact global solutions of qualifying polynomial matrix problems can be recovered by solving one finite semidefinite program from the hierarchy.","The flat truncation test becomes a reliable stopping criterion that confirms exactness has been achieved.","Nonlinear semidefinite programming optimality theory supplies sufficient conditions that guarantee the Moment-SOS method terminates exactly.","Minimizers of the original problem can be extracted directly from the moment matrix once flat truncation appears."],"fun_headline_variants":["Moment-SOS hierarchy converges finitely for polynomial matrix optimization","Finite convergence of Moment-SOS hierarchy under optimality conditions","Flat truncation detects finite convergence in Moment-SOS relaxations","Optimality conditions ensure finite Moment-SOS convergence for matrices","Moment-SOS hierarchy attains finite convergence with Archimedean property"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The nondegeneracy condition, strict complementarity condition, and second order sufficient condition must hold at every minimizer.","fun_headline_variants_meta":{"raw":{"variants":["Moment-SOS hierarchy converges finitely for polynomial matrix optimization","Finite convergence of Moment-SOS hierarchy under optimality conditions","Flat truncation detects finite convergence in Moment-SOS relaxations","Optimality conditions ensure finite Moment-SOS convergence for matrices","Moment-SOS hierarchy attains finite convergence with Archimedean property"]},"model":"grok-4.3","cost_usd":0.004107,"raw_usage":{"total_tokens":2026,"prompt_tokens":551,"num_sources_used":0,"completion_tokens":79,"cost_in_usd_ticks":41074500,"prompt_tokens_details":{"text_tokens":551,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1396,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":551,"tokens_out":79,"duration_ms":17594,"temperature":1.0,"reasoning_tokens":1396,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-24T03:13:30.382482+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A polynomial matrix optimization problem that satisfies the Archimedean property, has the stated optimality conditions at its minimizers, yet produces moment relaxations whose optimal values keep improving with every increase in relaxation order without ever reaching the true minimum.","supporting_citations":[],"review_version":1}