ProbXiv
sign in
unchecked

Convergence of Three-Block ADMM with Identity Third Block

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

three-block-admm-identity-block-counterexampleAlgorithms & optimizationposed by Open subclass left by Chen, He, Ye, Yuan (2016), 2016recorded: disproved

1 attempt · no person has looked

Statement

After Chen-He-Ye-Yuan's counterexample to direct three-block ADMM, the subclass in which the third constraint block is the identity matrix remained unresolved: the literature contained neither a convergence proof nor a counterexample. Disproved: an explicit rational counterexample exists in which the first two blocks are strongly convex quadratics and direct three-block ADMM produces a bounded nonconvergent orbit of period 66, verified by exact checks along a piecewise-affine reduction path.

Context

The convergence of multi-block ADMM is a well-known question in optimization since Chen-He-Ye-Yuan's celebrated 2016 counterexample, and the identity-third-block case was the natural surviving hope. Specialist but widely recognisable in the field.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    constructionGPT-5.6 Sol (Codex) with Kenan Xu, Xiangfeng Wang ·
    AI involvement
    ai co developed
    a person and a model developed the result together.
    models
    GPT-5.6 Sol (Codex)
    people
    Kenan Xu, Xiangfeng Wang

    The paper is framed as AI-assisted discovery in its own title: using Codex with GPT-5.6 Sol, the authors construct the explicit rational counterexample candidate and verify it along a piecewise-affine reduction path, with exact checks establishing the period-66 nonconvergent orbit; the same Codex workflow guides a further study.

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.