{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TAMHWAMNFRB3F7LGMUVLLHQVRH","short_pith_number":"pith:TAMHWAMN","schema_version":"1.0","canonical_sha256":"98187b018d2c43b2fd66652ab59e1589de7ec7fcda94ead79335e0b13ac9227e","source":{"kind":"arxiv","id":"2310.00376","version":1},"attestation_state":"computed","paper":{"title":"Self-adaptive ADMM for semi-strongly convex problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Tianyun Tang","submitted_at":"2023-09-30T13:40:31Z","abstract_excerpt":"In this paper, we develop a self-adaptive ADMM that updates the penalty parameter adaptively. When one part of the objective function is strongly convex i.e., the problem is semi-strongly convex, our algorithm can update the penalty parameter adaptively with guaranteed convergence. We establish various types of convergence results including accelerated convergence rate of O(1/k^2), linear convergence and convergence of iteration points. This enhances various previous results because we allow the penalty parameter to change adaptively. We also develop a partial proximal point method with the su"},"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":"2310.00376","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-09-30T13:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"396356d9d89c91d000b2cd12d766337fd708f99116b2ebef6afb62de9a1f722b","abstract_canon_sha256":"784960365fd5e0b0522503b4244946c2275cf47d7cafe8a443ec73155637cfd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:04.899219Z","signature_b64":"B09L1gQHvaxnlTgIyiH18n2mUNSmJZBDrtgxuhvuTNsWjzwlHTgPK0q4JST6m4Ebs4JkmIjI+6hOxZhvEvhTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98187b018d2c43b2fd66652ab59e1589de7ec7fcda94ead79335e0b13ac9227e","last_reissued_at":"2026-07-05T06:56:04.898715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:04.898715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-adaptive ADMM for semi-strongly convex problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Tianyun Tang","submitted_at":"2023-09-30T13:40:31Z","abstract_excerpt":"In this paper, we develop a self-adaptive ADMM that updates the penalty parameter adaptively. When one part of the objective function is strongly convex i.e., the problem is semi-strongly convex, our algorithm can update the penalty parameter adaptively with guaranteed convergence. We establish various types of convergence results including accelerated convergence rate of O(1/k^2), linear convergence and convergence of iteration points. This enhances various previous results because we allow the penalty parameter to change adaptively. We also develop a partial proximal point method with the su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00376","kind":"arxiv","version":1},"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/2310.00376/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":"2310.00376","created_at":"2026-07-05T06:56:04.898771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.00376v1","created_at":"2026-07-05T06:56:04.898771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00376","created_at":"2026-07-05T06:56:04.898771+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAMHWAMNFRB3","created_at":"2026-07-05T06:56:04.898771+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAMHWAMNFRB3F7LG","created_at":"2026-07-05T06:56:04.898771+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAMHWAMN","created_at":"2026-07-05T06:56:04.898771+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH","json":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH.json","graph_json":"https://pith.science/api/pith-number/TAMHWAMNFRB3F7LGMUVLLHQVRH/graph.json","events_json":"https://pith.science/api/pith-number/TAMHWAMNFRB3F7LGMUVLLHQVRH/events.json","paper":"https://pith.science/paper/TAMHWAMN"},"agent_actions":{"view_html":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH","download_json":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH.json","view_paper":"https://pith.science/paper/TAMHWAMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.00376&json=true","fetch_graph":"https://pith.science/api/pith-number/TAMHWAMNFRB3F7LGMUVLLHQVRH/graph.json","fetch_events":"https://pith.science/api/pith-number/TAMHWAMNFRB3F7LGMUVLLHQVRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH/action/storage_attestation","attest_author":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH/action/author_attestation","sign_citation":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH/action/citation_signature","submit_replication":"https://pith.science/pith/TAMHWAMNFRB3F7LGMUVLLHQVRH/action/replication_record"}},"created_at":"2026-07-05T06:56:04.898771+00:00","updated_at":"2026-07-05T06:56:04.898771+00:00"}