{"id":"16fae72a-53c6-40ba-8926-2ee5edce47e6","arxiv_id":"1907.10169","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A DMPC method is proposed that solves the dual problem via inexact primal-dual gradient optimization with Laplacian consensus and uses contraction theory to guarantee convergence, recursive feasibility, and stability under premature termination.","lead":"The paper develops a distributed model predictive control strategy for discrete-time linear systems with globally coupled constraints, solved via primal-dual gradient optimization using Laplacian consensus and contraction analysis to allow early termination while guaranteeing convergence. A smart generalist might read it for insights into scalable real-time control of networked systems where exact optimization at every step is impractical.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Contraction conditions for discrete-time primal-dual map invoked but not explicitly verified for the coupled dual problem","rationale":"The reader's weakest assumption already isolates the contraction-theory conditions as the hinge between inexact optimization and closed-loop guarantees; the above merely makes that hinge concrete and testable. No other gap (e.g., linear-system assumptions or tightening) appears more load-bearing once the contraction step is secured.","tokens_in":1625,"tokens_out":333,"duration_ms":13780,"concrete_test":"Locate the contraction-analysis section (post-abstract, likely containing the discrete-time map and theorem invocation); check whether an explicit metric M or bound on the spectral radius of the iteration Jacobian is derived using the problem data (Hessian of the dual, Laplacian eigenvalues, tightening parameters). If absent, substitute the dual gradient map into the standard discrete contraction test and recompute the required step-size upper bound.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that the discrete-time primal-dual gradient iteration (with Laplacian consensus) is contractive, so that inexact termination still yields a solution close enough for recursive feasibility and Lyapunov stability of the closed-loop DMPC. The paper states it adopts contraction theory for this discrete-time nonlinear case, yet the argument is load-bearing on whether a contraction metric exists and the step-size/Lipschitz conditions hold for the specific dual function arising from the globally coupled linear constraints. If only a general theorem is cited without constructing the metric or bounding the Jacobian eigenvalues for the consensus-augmented update, the link from optimization convergence to MPC stability fails.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper develops a distributed MPC strategy for discrete-time linear systems subject to globally coupled constraints. The dual problem is solved in a distributed fashion via primal-dual gradient iterations that incorporate Laplacian consensus; constraint tightening is introduced to permit early termination of the optimizer. Contraction theory is applied to establish convergence of the resulting discrete-time nonlinear dynamics, from which recursive feasibility and closed-loop stability are claimed to follow under inexact solutions, with a numerical example provided for illustration.","tokens_in":1748,"tokens_out":499,"duration_ms":15185,"significance":"If the contraction metric and associated bounds can be rigorously verified for the specific dual function induced by the coupled constraints, the approach would supply a principled route to lowering per-iteration computation in DMPC while retaining stability guarantees, extending standard primal-dual and consensus techniques to the inexact setting.","major_comments":[{"comment":"Convergence analysis section: the manuscript invokes contraction theory for the discrete-time primal-dual gradient map augmented by Laplacian consensus, yet provides neither an explicit construction of a contraction metric nor a verification that the required step-size and Lipschitz conditions hold for the dual function arising from the globally coupled linear constraints; because this property is load-bearing for the subsequent recursive-feasibility and Lyapunov-stability arguments, the link between inexact optimization and closed-loop guarantees remains unestablished.","section":"Convergence analysis section"},{"comment":"Recursive feasibility and stability section: the error bounds relating the inexact primal-dual iterates to the exact optimizer (and thence to the tightened constraint sets) are not derived; without quantitative propagation of the contraction residual into the MPC feasibility and Lyapunov decrease conditions, the central claim that stability holds under premature termination cannot be assessed.","section":"Recursive feasibility and stability section"}],"minor_comments":[{"comment":"The abstract states that results hold 'under some reasonable assumptions' without enumerating them; listing the key assumptions (e.g., on system matrices, graph connectivity, and step-size selection) would improve readability.","section":"Abstract"},{"comment":"Notation for the dual variables and the consensus-augmented update rule should be introduced with an explicit equation reference when first used, to avoid ambiguity when the contraction metric is later discussed.","section":"Notation and problem formulation"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive and detailed comments. We address each major point below and will revise the manuscript to strengthen the rigor of the analysis as suggested.","responses":[{"response":"We agree that the current version does not provide an explicit construction of the contraction metric or a direct verification of the step-size and Lipschitz conditions for the specific dual function. In the revised manuscript we will add an explicit construction of a contraction metric tailored to the discrete-time primal-dual gradient map with Laplacian consensus, together with a verification that the required conditions hold for the dual function induced by the globally coupled linear constraints under the paper's stated assumptions.","revision_made":"yes","referee_comment":"[Convergence analysis section] Convergence analysis section: the manuscript invokes contraction theory for the discrete-time primal-dual gradient map augmented by Laplacian consensus, yet provides neither an explicit construction of a contraction metric nor a verification that the required step-size and Lipschitz conditions hold for the dual function arising from the globally coupled linear constraints; because this property is load-bearing for the subsequent recursive-feasibility and Lyapunov-stability arguments, the link between inexact optimization and closed-loop guarantees remains unestablished."},{"response":"We acknowledge that explicit quantitative error bounds and their propagation into the feasibility and stability conditions are not derived in the present manuscript. The revised version will include derivations of the error bounds between the inexact primal-dual iterates and the exact optimizer, followed by a quantitative propagation of the contraction residual into the tightened constraint sets, recursive feasibility, and Lyapunov decrease conditions.","revision_made":"yes","referee_comment":"[Recursive feasibility and stability section] Recursive feasibility and stability section: the error bounds relating the inexact primal-dual iterates to the exact optimizer (and thence to the tightened constraint sets) are not derived; without quantitative propagation of the contraction residual into the MPC feasibility and Lyapunov decrease conditions, the central claim that stability holds under premature termination cannot be assessed."}],"tokens_in":1299,"tokens_out":424,"duration_ms":12195,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core idea is to solve the dual of a DMPC problem with Laplacian consensus, stop the primal-dual iterations early after constraint tightening, and still recover recursive feasibility plus closed-loop stability. They claim contraction analysis is used for the first time on the discrete-time primal-dual dynamics with a nonlinear objective. That is a modest incremental step in the DMPC literature and gives a concrete way to trade computation for guaranteed performance in networked linear systems. The simulation is included to check the claims in a simple case, which is standard and helpful here. The approach builds directly on existing primal-dual and consensus tools without obvious circularity or invented entities. The soft spot is exactly the one flagged in the stress test. The stability argument requires the discrete-time primal-dual map (with the coupled dual and Laplacian terms) to be contractive under the chosen step sizes. If the paper only cites a general theorem without exhibiting a metric or bounding the relevant Jacobian for this specific dual function, the link from inexact optimization error to MPC guarantees is not fully closed. The abstract states the result but does not display the verification, so the soundness depends on whether those details appear in the body. This is aimed at people already working on distributed MPC and inexact solvers for linear systems. A reader who needs a practical early-termination method with some theory behind it could extract value, though the scope stays narrow. It is coherent enough on its own terms to deserve a serious referee, even if the contraction part will need close checking.","headline":"The paper applies contraction theory to certify convergence of an inexact primal-dual solver for distributed linear MPC with coupled constraints, but the contraction metric for the consensus-augmented dual map is not shown to be constructed explicitly.","tokens_in":2209,"tokens_out":391,"would_cite":false,"duration_ms":16065,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"DMPC primal-dual contraction analysis uses standard Riemannian metrics and strong-convexity assumptions; no J-cost, ratio symmetry, or φ-ladder structure","alignment":"orthogonal","rationale":"The paper's core machinery (Theorems 1–4) relies on a custom Riemannian metric M for discrete-time PDGD contraction, Lipschitz/strong-convexity bounds on Ji, and Laplacian consensus; none of these invoke the RS recognition cost J(x)=½(x+x⁻¹)−1, the functional-equation uniqueness of J, φ-fixed-point ladder, 8-tick periodicity, or parameter-free constant derivations. The domain (inexact DMPC with coupled linear constraints) lies outside the RS forcing chain from a single distinction.","tokens_in":54024,"confidence":"high","tokens_out":171,"duration_ms":4780,"cache_read_input_tokens":38528,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Distributed MPC for linear systems with coupled constraints remains recursively feasible and stable under inexact primal-dual gradient solutions.","keywords":["distributed model predictive control","primal-dual gradient","contraction analysis","inexact optimization","coupled constraints","recursive feasibility","stability analysis"],"falsifier":"An example where the closed-loop system becomes unstable or the optimization loses feasibility when using the inexact primal-dual solutions under the paper's stated assumptions.","tokens_in":2517,"feed_emoji":"","tokens_out":502,"duration_ms":22375,"temperature":0.7,"pith_summary":"The paper develops a distributed model predictive control approach for discrete-time linear systems subject to globally coupled constraints. The dual problem is solved distributively via primal-dual gradient optimization with Laplacian consensus, and constraint tightening permits early termination of the iterations. Contraction theory is used to analyze convergence of the discrete-time primal-dual dynamics to a nonlinear objective. This setup allows proofs of recursive feasibility and closed-loop stability even when the optimization is solved inexactly.","feed_headline":"DMPC stays stable with inexact distributed solves","feed_subtitle":"Contraction analysis and constraint tightening let linear systems with coupled constraints terminate optimization early while keeping feasb","key_machinery":"Primal-dual gradient optimization using Laplacian consensus, combined with constraint tightening and analyzed by contraction theory for discrete-time dynamics.","core_discovery":"Under assumptions on the system and contraction conditions, the DMPC strategy based on inexact primal-dual gradient optimization with distributed consensus achieves recursive feasibility and stability of the closed-loop system.","pith_inferences":["This method could apply to systems where exact optimization is computationally prohibitive.","Similar contraction-based analysis might be used for other distributed optimization problems in control.","The approach suggests potential for reducing computation in large networks of subsystems."],"forward_implications":["The optimization can terminate prematurely while maintaining convergence guarantees.","Recursive feasibility holds for the DMPC problem despite inexact solutions.","Closed-loop stability is guaranteed under the inexact optimization.","Distributed implementation is enabled through consensus on the dual variables."],"fun_headline_variants":["Inexact distributed DMPC achieves recursive stability","Contraction analysis proves DMPC stability with inexact solves","Distributed consensus enables feasible DMPC under inexact optimization","Recursive feasibility for DMPC via primal-dual contraction analysis"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The discrete-time linear system properties and the conditions for contraction theory to prove convergence of the primal-dual gradient dynamics are satisfied.","fun_headline_variants_meta":{"raw":{"variants":["Inexact distributed DMPC achieves recursive stability","Contraction analysis proves DMPC stability with inexact solves","Distributed consensus enables feasible DMPC under inexact optimization","Recursive feasibility for DMPC via primal-dual contraction analysis"]},"model":"grok-4.3","cost_usd":0.004267,"raw_usage":{"total_tokens":2086,"prompt_tokens":543,"num_sources_used":0,"completion_tokens":61,"cost_in_usd_ticks":42674500,"prompt_tokens_details":{"text_tokens":543,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1482,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":543,"tokens_out":61,"duration_ms":9696,"temperature":1.0,"reasoning_tokens":1482,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-24T16:56:34.270430+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An example where the closed-loop system becomes unstable or the optimization loses feasibility when using the inexact primal-dual solutions under the paper's stated assumptions.","supporting_citations":[],"review_version":1}