{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YONUYZA23S7ZO2BYYHJWLZHSI2","short_pith_number":"pith:YONUYZA2","schema_version":"1.0","canonical_sha256":"c39b4c641adcbf976838c1d365e4f246a206dac55778104982f6f4270d244802","source":{"kind":"arxiv","id":"1705.03412","version":8},"attestation_state":"computed","paper":{"title":"Nonconvex Generalization of Alternating Direction Method of Multipliers for Nonlinear Equality Constrained Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.OC","authors_text":"Junxiang Wang, Liang Zhao","submitted_at":"2017-05-09T16:28:24Z","abstract_excerpt":"The classic Alternating Direction Method of Multipliers (ADMM) is a popular framework to solve linear-equality constrained problems. In this paper, we extend the ADMM naturally to nonlinear equality-constrained problems, called neADMM. The difficulty of neADMM is to solve nonconvex subproblems. We provide globally optimal solutions to them in two important applications. Experiments on synthetic and real-world datasets demonstrate excellent performance and scalability of our proposed neADMM over existing state-of-the-start methods."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.03412","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-09T16:28:24Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0462c9f780ba8e4de63287ae2bb4855b7cab3fce0e42879900ea17ab70461052","abstract_canon_sha256":"865c4d51125742d712ec38b30ea4607376913e87d897053f207318bf67cf686f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:23:02.706787Z","signature_b64":"y2EBUKYc1AP/qhEAZ9mgdJU+cLk6L/Zd5cCQgq0sXnI1qKdhOkqVbSrue9jV5ptPpCNU3V1b1SKN81h0kTesCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c39b4c641adcbf976838c1d365e4f246a206dac55778104982f6f4270d244802","last_reissued_at":"2026-07-05T02:23:02.706422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:23:02.706422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonconvex Generalization of Alternating Direction Method of Multipliers for Nonlinear Equality Constrained Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.OC","authors_text":"Junxiang Wang, Liang Zhao","submitted_at":"2017-05-09T16:28:24Z","abstract_excerpt":"The classic Alternating Direction Method of Multipliers (ADMM) is a popular framework to solve linear-equality constrained problems. In this paper, we extend the ADMM naturally to nonlinear equality-constrained problems, called neADMM. The difficulty of neADMM is to solve nonconvex subproblems. We provide globally optimal solutions to them in two important applications. Experiments on synthetic and real-world datasets demonstrate excellent performance and scalability of our proposed neADMM over existing state-of-the-start methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03412","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1705.03412/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.03412","created_at":"2026-07-05T02:23:02.706490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03412v8","created_at":"2026-07-05T02:23:02.706490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03412","created_at":"2026-07-05T02:23:02.706490+00:00"},{"alias_kind":"pith_short_12","alias_value":"YONUYZA23S7Z","created_at":"2026-07-05T02:23:02.706490+00:00"},{"alias_kind":"pith_short_16","alias_value":"YONUYZA23S7ZO2BY","created_at":"2026-07-05T02:23:02.706490+00:00"},{"alias_kind":"pith_short_8","alias_value":"YONUYZA2","created_at":"2026-07-05T02:23:02.706490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.13390","citing_title":"Accelerated Optimization of Implicit Neural Representations for CT Reconstruction","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2","json":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2.json","graph_json":"https://pith.science/api/pith-number/YONUYZA23S7ZO2BYYHJWLZHSI2/graph.json","events_json":"https://pith.science/api/pith-number/YONUYZA23S7ZO2BYYHJWLZHSI2/events.json","paper":"https://pith.science/paper/YONUYZA2"},"agent_actions":{"view_html":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2","download_json":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2.json","view_paper":"https://pith.science/paper/YONUYZA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03412&json=true","fetch_graph":"https://pith.science/api/pith-number/YONUYZA23S7ZO2BYYHJWLZHSI2/graph.json","fetch_events":"https://pith.science/api/pith-number/YONUYZA23S7ZO2BYYHJWLZHSI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2/action/storage_attestation","attest_author":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2/action/author_attestation","sign_citation":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2/action/citation_signature","submit_replication":"https://pith.science/pith/YONUYZA23S7ZO2BYYHJWLZHSI2/action/replication_record"}},"created_at":"2026-07-05T02:23:02.706490+00:00","updated_at":"2026-07-05T02:23:02.706490+00:00"}