{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VD65BGJEQ5KZIG6PD7Q2YASCEX","short_pith_number":"pith:VD65BGJE","schema_version":"1.0","canonical_sha256":"a8fdd099248755941bcf1fe1ac024225e74f70835d6cfb362d4401a766a4a719","source":{"kind":"arxiv","id":"1912.03690","version":2},"attestation_state":"computed","paper":{"title":"Dynamical Primal-Dual Accelerated Method with Applications to Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Jinlong Lei, Xianlin Zeng","submitted_at":"2019-12-08T14:47:35Z","abstract_excerpt":"This paper develops a continuous-time primal-dual accelerated method with an increasing damping coefficient for a class of convex optimization problems with affine equality constraints. This paper analyzes critical values for parameters in the proposed method and prove that the rate of convergence in terms of the duality gap function is $O(\\tfrac{1}{t^2})$ by choosing suitable parameters. As far as we know, this is the first continuous-time primal-dual accelerated method that can obtain the optimal rate. Then this work applies the proposed method to two network optimization problems, a distrib"},"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":"1912.03690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-08T14:47:35Z","cross_cats_sorted":[],"title_canon_sha256":"e071af05201aeba5780559b891c036029eaa7f1b26ec3a32da248cf87f85944a","abstract_canon_sha256":"f8e0d62797a3d09196d5392f612aeb27d90a13dc4a915e165b80f54035d2866f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:43.560713Z","signature_b64":"yucVpzbMV5a52FwzIvo9K0AspOt2WkQ3VYbGIIzVLXZKxenVbwE5SZDsRmr75WddRbId5lTsHZ7DdFMfllEWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fdd099248755941bcf1fe1ac024225e74f70835d6cfb362d4401a766a4a719","last_reissued_at":"2026-07-05T03:56:43.560309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:43.560309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamical Primal-Dual Accelerated Method with Applications to Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Jinlong Lei, Xianlin Zeng","submitted_at":"2019-12-08T14:47:35Z","abstract_excerpt":"This paper develops a continuous-time primal-dual accelerated method with an increasing damping coefficient for a class of convex optimization problems with affine equality constraints. This paper analyzes critical values for parameters in the proposed method and prove that the rate of convergence in terms of the duality gap function is $O(\\tfrac{1}{t^2})$ by choosing suitable parameters. As far as we know, this is the first continuous-time primal-dual accelerated method that can obtain the optimal rate. Then this work applies the proposed method to two network optimization problems, a distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03690","kind":"arxiv","version":2},"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/1912.03690/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":"1912.03690","created_at":"2026-07-05T03:56:43.560379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.03690v2","created_at":"2026-07-05T03:56:43.560379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03690","created_at":"2026-07-05T03:56:43.560379+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD65BGJEQ5KZ","created_at":"2026-07-05T03:56:43.560379+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD65BGJEQ5KZIG6P","created_at":"2026-07-05T03:56:43.560379+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD65BGJE","created_at":"2026-07-05T03:56:43.560379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14828","citing_title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX","json":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX.json","graph_json":"https://pith.science/api/pith-number/VD65BGJEQ5KZIG6PD7Q2YASCEX/graph.json","events_json":"https://pith.science/api/pith-number/VD65BGJEQ5KZIG6PD7Q2YASCEX/events.json","paper":"https://pith.science/paper/VD65BGJE"},"agent_actions":{"view_html":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX","download_json":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX.json","view_paper":"https://pith.science/paper/VD65BGJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.03690&json=true","fetch_graph":"https://pith.science/api/pith-number/VD65BGJEQ5KZIG6PD7Q2YASCEX/graph.json","fetch_events":"https://pith.science/api/pith-number/VD65BGJEQ5KZIG6PD7Q2YASCEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX/action/storage_attestation","attest_author":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX/action/author_attestation","sign_citation":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX/action/citation_signature","submit_replication":"https://pith.science/pith/VD65BGJEQ5KZIG6PD7Q2YASCEX/action/replication_record"}},"created_at":"2026-07-05T03:56:43.560379+00:00","updated_at":"2026-07-05T03:56:43.560379+00:00"}