{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W27NNELNSPXNLYKKQIPQ4MWBLS","short_pith_number":"pith:W27NNELN","schema_version":"1.0","canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","source":{"kind":"arxiv","id":"1604.02216","version":1},"attestation_state":"computed","paper":{"title":"A Primal-Dual Type Algorithm with the $O(1/t)$ Convergence Rate for Large Scale Constrained Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely","submitted_at":"2016-04-08T03:25:32Z","abstract_excerpt":"This paper considers large scale constrained convex programs, which are usually not solvable by interior point methods or other Newton-type methods due to the prohibitive computation and storage complexity for Hessians and matrix inversions. Instead, large scale constrained convex programs are often solved by gradient based methods or decomposition based methods. The conventional primal-dual subgradient method, aka, Arrow-Hurwicz-Uzawa subgradient method, is a low complexity algorithm with the $O(1/\\sqrt{t})$ convergence rate, where $t$ is the number of iterations. If the objective and constra"},"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":"1604.02216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:25:32Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"7a29c68e76b1b3673abfc8ba35965677a5c3e35f1ccc2857deb0ee84c2cb2b02","abstract_canon_sha256":"ce628bd8d46588d791278360f4df170d96d445bba6fea1125f3a2311eee54c30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:14.530910Z","signature_b64":"Z05Wt4PGv5kUMa3QMU2aHMpdk23PAw/GSzrFi6ew+ErW5fTlxExklSG2TNWQqclbBmlsRLjqa6hvXBWSGkSUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6bed6916d93eed5e14a821f0e32c15c8498e03ac621686efcfcdf0815310944","last_reissued_at":"2026-05-18T01:10:14.530510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:14.530510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Primal-Dual Type Algorithm with the $O(1/t)$ Convergence Rate for Large Scale Constrained Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely","submitted_at":"2016-04-08T03:25:32Z","abstract_excerpt":"This paper considers large scale constrained convex programs, which are usually not solvable by interior point methods or other Newton-type methods due to the prohibitive computation and storage complexity for Hessians and matrix inversions. Instead, large scale constrained convex programs are often solved by gradient based methods or decomposition based methods. The conventional primal-dual subgradient method, aka, Arrow-Hurwicz-Uzawa subgradient method, is a low complexity algorithm with the $O(1/\\sqrt{t})$ convergence rate, where $t$ is the number of iterations. If the objective and constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02216","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":""},"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":"1604.02216","created_at":"2026-05-18T01:10:14.530575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02216v1","created_at":"2026-05-18T01:10:14.530575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02216","created_at":"2026-05-18T01:10:14.530575+00:00"},{"alias_kind":"pith_short_12","alias_value":"W27NNELNSPXN","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W27NNELNSPXNLYKK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W27NNELN","created_at":"2026-05-18T12:30:48.956258+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/W27NNELNSPXNLYKKQIPQ4MWBLS","json":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS.json","graph_json":"https://pith.science/api/pith-number/W27NNELNSPXNLYKKQIPQ4MWBLS/graph.json","events_json":"https://pith.science/api/pith-number/W27NNELNSPXNLYKKQIPQ4MWBLS/events.json","paper":"https://pith.science/paper/W27NNELN"},"agent_actions":{"view_html":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS","download_json":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS.json","view_paper":"https://pith.science/paper/W27NNELN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02216&json=true","fetch_graph":"https://pith.science/api/pith-number/W27NNELNSPXNLYKKQIPQ4MWBLS/graph.json","fetch_events":"https://pith.science/api/pith-number/W27NNELNSPXNLYKKQIPQ4MWBLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/action/storage_attestation","attest_author":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/action/author_attestation","sign_citation":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/action/citation_signature","submit_replication":"https://pith.science/pith/W27NNELNSPXNLYKKQIPQ4MWBLS/action/replication_record"}},"created_at":"2026-05-18T01:10:14.530575+00:00","updated_at":"2026-05-18T01:10:14.530575+00:00"}