{"id":"c8c0ea85-06e2-46d9-ae82-98939468517f","arxiv_id":"2607.26622","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Primal-dual active set methods for obstacle problems suffer exponentially growing iteration counts under mesh refinement due to layer-by-layer active-set peeling, while Signorini-type problems grow only linearly.","lead":"This paper shows that a popular iterative solver for constrained optimization problems, the primal-dual active set method, requires more and more iterations as the computational mesh is refined: exponentially more for obstacle problems, linearly more for contact (Signorini) problems. It proves why this happens and explains the difference through the geometry of the active set and the regularity of the Lagrange multiplier iterates.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 7.7's sublinear convergence for the thin obstacle problem assumes A* ⊆ A^k and u^k ≤ φ without an induction proof; if these fail, the h→0 transfer of (5.2) and the claimed rate collapse.","rationale":"The reader's weakest assumption and my stress-test converge on the same point: Theorem 7.7 transfers the finite-dimensional rate (5.2) to the limit, but the hypotheses A* ⊆ A^k and u^k ≤ φ are assumed, not established, for the infinite-dimensional iteration. This is the correct load-bearing concern because the paper's distinctive theoretical payoff for the thin obstacle/Signorini setting is the sublinear convergence theorem; without those hypotheses the h→0 limit does not follow. I do not see a fatal flaw in the finite-dimensional peeling Theorem 6.2: the proof is internally consistent for the constant-obstacle, positive-f case, and the numerical iteration counts strongly support the exponential-growth phenomenon for Problem 1. The abstract's broader phrasing about 'obstacle problems' is also slightly overgeneralized relative to the constant-obstacle theorem, but this is secondary. The right verdict remains CONDITIONAL: the finite-dimensional contribution is convincing, while the infinite-dimensional convergence result needs either an induction proof of the hypotheses or a weakened statement. Since the reader already identified the same weakest assumption, no change to the verdict is needed.","tokens_in":28703,"tokens_out":13400,"duration_ms":153692,"concrete_test":"On the 2D thin obstacle problem (Problem 2), run HIK from u^0=λ^0=0 on uniformly refined meshes h=2^{-6},...,2^{-9}. After each iteration k≥2, compute (i) whether every node of the discrete true active set A*_h lies in A^k_h, and (ii) max_{Γ}(u^k_h−φ)_+. If both hold for all k up to numerical convergence, the induction input to Theorem 7.7 is plausible; if either fails at some k, the limit passage from (5.2) is unsupported and the sublinear-convergence claim needs an independent derivation not relying on Theorem 5.3.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing gap is in §7.1/Theorem 7.7. The infinite-dimensional sublinear rate is obtained by sending h→0 in the finite-dimensional identity (5.2). But (5.2) is Theorem 5.3, whose hypotheses are A*_h ⊆ A^k_h and u^k_h ≤ φ (the latter is needed for Lemma 5.1(iv)). The paper simply assumes the continuous analogues A* ⊆ A^k and u^k ≤ φ a.e. on Γ in Theorem 7.7 and does not prove them by induction for k ≥ 2. Section 7.1 establishes only W^{2,p}×L^q regularity and well-definedness of A^k; it never verifies the active-set inclusion or primal feasibility along the refinement sequence. Proposition 7.2 only shows λ^k has a negative part when u^k ≤ φ is already assumed. Since the claim that HIK 'converges at a guaranteed sublinear rate' for the thin obstacle rests on passing (5.2) to the limit, an unproven hypothesis at step k of the induction invalidates that conclusion. This does not damage the finite-dimensional peeling result (Theorem 6.2), which is independent and well supported, but it is the linchpin of the infinite-dimensional explanation for thin-obstacle and Signorini behaviour.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies mesh-dependent iteration counts of the primal-dual active set strategy (HIK) on uniformly refined finite-element discretizations of obstacle, thin-obstacle, and Signorini problems. Numerically, obstacle problems show roughly exponential growth (iteration count roughly doubling per refinement), while thin-obstacle and Signorini problems show mild linear growth. The paper offers three theoretical contributions: (i) a finite-dimensional global convergence-rate identity (Theorem 5.3) expressing the HIK contraction factor in terms of the dual-feasibility violation of the current multiplier on the inactive set; (ii) a 'sticky active sets' theorem (Theorem 6.2) asserting that for the constant-obstacle problem a degree of freedom whose whole star patch is active cannot deactivate in one iteration, implying layer-by-layer peeling; and (iii) an infinite-dimensional analysis showing that for the thin obstacle problem the HIK iterates remain well-defined with W^{2,p}×L^q regularity and claiming a guaranteed sublinear convergence rate (Theorem 7.7), whereas for the classical obstacle problem the second multiplier iterate is a singular measure and the next active set is ill-defined. The paper includes reproducible Julia code and extensive numerical tables.","tokens_in":29060,"tokens_out":13939,"duration_ms":149519,"significance":"If the core claims hold, the paper identifies and explains a practically important phenomenon: a supposedly superlinearly convergent active-set solver can lose mesh independence in a problem-dependent way, from mild linear growth to exponential growth, depending on the codimension of the constraint. The finite-dimensional rate identity in Theorem 5.3 is a clean and useful diagnostic, and the distinction between bulk obstacles and codimension-one obstacles is conceptually valuable. The regularity analysis for the thin obstacle problem is nontrivial and appears largely sound. The paper also ships reproducible software, which strengthens its empirical claims. However, the infinite-dimensional transfer and the peeling proof have load-bearing gaps detailed below; the paper is not yet at the level of its abstract and conclusions.","major_comments":[{"comment":"The proof passes h→0 in the finite-dimensional identity (5.2), but Theorem 5.3 requires A*_h ⊆ A^k_h and u^k_h ≤ φ on the discrete constraint set. Theorem 7.7 assumes only the continuous analogues A* ⊆ A^k and u^k ≤ φ on Γ, and the proof never verifies these discrete hypotheses by induction, nor does it show that the continuous assumptions survive discretization. Lemma 7.5 and Proposition 7.6 transfer regularity and active-set convergence, but not primal feasibility or active-set inclusion. Therefore (7.14)–(7.15) are conditional, and the abstract/conclusion claim that HIK 'converges at a guaranteed sublinear rate' for the thin obstacle problem is not established as written. Proposition 7.2, used to guarantee a nontrivial sublinear rate, has the same unproved hypothesis u^k≤φ.","section":"§7.1, Theorem 7.7"},{"comment":"The proof asserts 'Aφ=0' from ∇φ_h=0. For the reduced P1 stiffness matrix with homogeneous Dirichlet conditions incorporated, the coefficient vector φ=φ̄ at the interior dofs does not represent the constant function φ̄ on Ω, since the boundary dofs are fixed to zero. Already in 1D, A times the all-ones vector is nonzero at nodes adjacent to the boundary. Hence the elimination of A_{S,A}φ in (6.10) is not justified in general, and the contradiction b_{S^k}≤0 does not follow. The theorem may be salvageable for Problem 1 after the first iteration by restricting to active sets whose star patches avoid ∂Ω, but that restriction is neither stated nor proved.","section":"§6, proof of Theorem 6.2"}],"minor_comments":[{"comment":"The abstract's 'obstacle problems' is broader than the hypotheses of Theorem 6.2, which assume a constant obstacle and f ≥ c_f > 0. The numerical and theoretical claims should be qualified accordingly.","section":"Abstract and §6"},{"comment":"The Hölder exponent in the boundary-integral estimate appears to be (3q-4)/(4q), not (4q-5)/(4q), and positivity of this exponent requires q > 4/3 rather than q > 5/4. The convergence conclusion is likely repairable with q chosen in (4/3, 8/5), but the displayed estimate is not correct as written.","section":"§7.1, Proposition 7.6"},{"comment":"The statement 'exponential iteration growth (asymptotically doubling with each refinement)' fits the 1D and 2D obstacle results, but the 3D column (5,7,10,15,27) shows a slower growth pattern. A brief qualification would avoid overstating the observed rate.","section":"Table 2 and §4"},{"comment":"Minor typos: 'W ell-posedness' in §7.1, 'seeminlgly' in §4, 'freedeom' in §8. The PETSc routine name 'vinewtonrsls' in the abstract appears to be intentional but may be confusing to readers not familiar with PETSc.","section":"Various"}],"recommendation":"major_revision","confidential_remarks":"The manuscript has a valuable core and its numerics are reproducible, but the two major issues above are load-bearing for the paper's central claims. The infinite-dimensional sublinear convergence theorem should either be proved with the missing induction steps or explicitly presented as conditional on open hypotheses; the peeling theorem needs a corrected proof. I would not reject, but I would not accept before these points are resolved."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"What you should know: this paper documents a real and important phenomenon. HIK/PDAS iteration counts grow under mesh refinement—exponentially for obstacle problems, linearly for Signorini and thin-obstacle problems—and the authors provide reproducible code, clean finite-dimensional proofs, and a convincing explanation via dual-feasibility violation. The layer-by-layer peeling theorem (6.2) and the rate formula (5.3) are genuine contributions.\n\nThe experimental core is the strongest part. The tables show the exponential doubling for obstacle problems and the mild additive growth for Signorini, and the convergence plots support the narrative. The software is archived, so the numbers can be checked. That alone justifies a serious referee.\n\nThe finite-dimensional analysis is also in good shape. Theorem 5.3 is a neat global rate tied to the norm of the multiplier on the inactive set, and Theorem 6.2—for constant obstacle and positive forcing—cleanly explains why only boundary dofs can deactivate. The proof is self-contained and the intuition (codimension of the active set) is correct.\n\nThe soft spot is Theorem 7.7. It assumes A* ⊆ A^k and u^k ≤ φ for the infinite-dimensional iterates, and the proof sends h→0 in the finite-dimensional identity (5.2), which needs the discrete analogues of those assumptions at each k. The paper never proves these by induction. Section 7.1 establishes regularity and well-posedness of the iterates, but not primal feasibility or the active-set inclusion. Proposition 7.2 even uses u^k ≤ φ as an hypothesis to derive the negativity of λ^k. So the claimed sublinear convergence is conditional in a way the abstract and conclusions do not communicate: the conclusion says \"we prove that HIK converges at a sublinear rate\" without the theorem's qualifiers. This matters because Theorem 7.7 is the linchpin of the infinite-dimensional explanation for the thin-obstacle and Signorini behavior. The earlier remark (7.8) that proving linear rate is open shows the authors are aware of gaps, but the gap here is before that: the asserted sublinear rate itself is not unconditional.\n\nAlso minor: the abstract says \"for obstacle problems\" when Theorem 6.2 covers only constant obstacle and f ≥ c_f > 0. That is overreach but easily fixed in revision.\n\nOverall, the paper deserves peer review. The finite-dimensional theory and numerical evidence are publishable on their own; the infinite-dimensional part needs either proofs of the missing hypotheses or a clearly labeled conditional theorem. A good referee can help sort that out.","headline":"Finite-dimensional peeling results and the numerical study are solid, but the infinite-dimensional convergence theorem rests on unproven hypotheses that the abstract and conclusions overstate.","tokens_in":29485,"tokens_out":2985,"would_cite":true,"duration_ms":34116,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35R35","49J40","65K10","65K15","90C33","90C53"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that the standard primal-dual active set solver, despite superlinear convergence on each fixed mesh, needs exponentially many iterations on refined obstacle problems and loses well-posedness in the continuum limit.","keywords":["primal-dual active set","semismooth Newton method","mesh dependence","obstacle problem","thin obstacle problem","Signorini problem","active set peeling","infinite-dimensional convergence"],"falsifier":"On a fine 1D mesh, run the PDAS solver on the constant-obstacle problem and record the active set each iteration. Theorem 6.2 predicts that a node whose two neighbours are active stays active; if any such interior node deactivates, the theorem is false. Alternatively, replace the constant obstacle with a smooth nonconstant one (e.g. phi = 1 + 0.1 sin x) keeping f = 20: if iteration counts stop doubling, the exponential-growth claim depends essentially on the constant-obstacle assumption.","tokens_in":28636,"feed_emoji":"📉","tokens_out":7584,"duration_ms":76020,"temperature":0.7,"pith_summary":"The paper establishes that the widely used primal-dual active set strategy, when applied to discretized variational inequalities, does not converge mesh-independently: as the mesh is uniformly refined, the number of iterations grows without bound. For obstacle problems the growth is exponential—asymptotically doubling per refinement—and the paper proves the mechanism: during the deactivation phase, a node whose whole star patch is active cannot leave the active set in the next iteration, so the active set can only shrink one layer of nodes at a time. For thin-obstacle and Signorini problems the growth is only linear, because active nodes always border inactive nodes, but the paper shows the solver still loses its local superlinear convergence in the infinite-dimensional limit. A global convergence-rate identity ties the speed of the iteration to the size of the dual feasibility violation on the inactive set; in the infinite-dimensional setting this quantity vanishes for the standard obstacle problem, making the iterates ill-defined from the second iteration onward, while for codimension-one obstacles it stays positive and guarantees only sublinear convergence.","feed_headline":"Active-set solver doubles iterations per mesh refinement","feed_subtitle":"Obstacle-problem nodes peel one layer per iteration, so iteration counts double per refinement.","key_machinery":"The central mechanism is Theorem 6.2, the 'sticky active sets' result: for a P1 finite-element discretization of the constant-obstacle problem with positive forcing, if a node and all nodes in its star patch (the union of elements touching that node) are active, the node must remain active at the next iteration. This implies the layer-by-layer peeling effect: only boundary nodes of the active set can deactivate, so each iteration removes at most one layer. Complementing it is Theorem 5.3, a global convergence-rate identity stating that the squared energy-distance to the solution decreases exactly by the squared dual feasibility violation of the multiplier on the current inactive set; this ra","core_discovery":"The central claim is that the primal-dual active set (PDAS) iteration converges superlinearly on every fixed finite-element mesh, yet the convergence rate is not uniform in the mesh size for obstacle and Signorini problems. For the obstacle problem, Theorem 6.2 shows that a degree of freedom whose entire star patch is active at iteration k must be active at iteration k+1, provided the obstacle is constant and the forcing is strictly positive. Consequently the active set can only shed one layer of nodes per iteration during deactivation, so a uniformly refined problem needs exponentially many iterations; in the limit h→0 the infinite-dimensional iterate is ill-defined from the second iteratio","pith_inferences":["Beyond the paper: any PDAS variant whose deactivation step is local in the finite-element stencil—line-search, inexact, or damped versions included—should inherit the same exponential peeling cost on codimension-zero obstacles, a prediction the paper does not test.","Beyond the paper: because the obstacle-problem failure is caused by a multiplier iterate that is a measure, switching multiplier discretization to the primal space should not restore mesh independence; the paper's numerical appendix shows it does not, implying genuinely structural solver changes are needed.","Beyond the paper: the same codimension mechanism may explain the exponential growth the paper reports for state-constrained and H1-control optimal control problems, where the constraint acts on the whole domain rather than a codimension-one set."],"forward_implications":["On uniformly refined meshes, naive PDAS solvers for obstacle problems require an iteration count that grows roughly like the number of layers of nodes to peel, i.e. exponentially in the number of refinements, so direct solves become prohibitively expensive.","For thin-obstacle and Signorini problems, iteration counts grow only additively, so the mesh dependence is mild but still present; local superlinear convergence disappears as h→0.","In infinite dimensions, the obstacle-problem PDAS iteration is not merely slow but mathematically ill-defined after the first correction, because the multiplier iterate becomes a measure concentrated on the free boundary.","The convergence-rate identity gives a concrete target for acceleration: reducing the dual feasibility violation on the inactive set is exactly what reduces the contraction factor.","Grid sequencing or multilevel initial guesses can hide the peeling cost by supplying an initial active set close to the true one, but the cost then shifts to solving on every parent mesh."],"fun_headline_variants":["Obstacle problems make active-set iterations double per mesh refinement","One active layer peeled per iteration: obstacle problems double iteration count","Obstacle problems exponentially slow active-set convergence under refinement","Mesh refinement turns PDAS superlinear convergence into exponential iteration counts"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The exponential-growth claim rests on a theorem that assumes a constant obstacle and strictly positive forcing, and the infinite-dimensional convergence theorem assumes active-set nesting and primal feasibility that are not established by induction; if either premise fails, the paper's headline conclusions do not follow.","fun_headline_variants_meta":{"raw":{"variants":["Obstacle problems make active-set iterations double per mesh refinement","One active layer peeled per iteration: obstacle problems double iteration count","Obstacle problems exponentially slow active-set convergence under refinement","Mesh refinement turns PDAS superlinear convergence into exponential iteration counts"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000835,"raw_usage":{"total_tokens":3494,"prompt_tokens":773,"completion_tokens":2721,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":517,"completion_tokens_details":{"reasoning_tokens":2651}},"tokens_in":517,"tokens_out":2721,"duration_ms":19740,"temperature":1.0,"reasoning_tokens":2651,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T12:05:11.840413+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"On a fine 1D mesh, run the PDAS solver on the constant-obstacle problem and record the active set each iteration. Theorem 6.2 predicts that a node whose two neighbours are active stays active; if any such interior node deactivates, the theorem is false. Alternatively, replace the constant obstacle with a smooth nonconstant one (e.g. phi = 1 + 0.1 sin x) keeping f = 20: if iteration counts stop doubling, the exponential-growth claim depends essentially on the constant-obstacle assumption.","supporting_citations":[],"review_version":1}