{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LPTVQO4HTO66DU32SOXRMORE22","short_pith_number":"pith:LPTVQO4H","schema_version":"1.0","canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","source":{"kind":"arxiv","id":"1605.02970","version":1},"attestation_state":"computed","paper":{"title":"Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexey Chernov, Pavel Dvurechensky","submitted_at":"2016-05-10T12:15:18Z","abstract_excerpt":"In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality constraints. A number of optimization problems in applications can be stated in this form, examples being the entropy-linear programming, the ridge regression, the elastic net, the regularized optimal transport, etc. We extend the Fast Gradient Method applied to the dual problem in order to make it primal-dual so that it allows not only to solve the dual problem, b"},"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":"1605.02970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-10T12:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"713db4d25fb1a192b6554fe3c2618acd58490fe6b56b27c44018bdbc6cbbff56","abstract_canon_sha256":"731df4e7c91a29e68c7ee9a14f65e8dab537bbd9df504ae47b870080d66b48d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:08.020732Z","signature_b64":"sAXYYiPEswLiScpNTVcA+JorVlrAO54LIrQMk3szFEh+4chGd3yHZCumL3Y9UWy2AJPKSo6hGIpgzFocUxAgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","last_reissued_at":"2026-05-18T01:15:08.019414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:08.019414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexey Chernov, Pavel Dvurechensky","submitted_at":"2016-05-10T12:15:18Z","abstract_excerpt":"In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality constraints. A number of optimization problems in applications can be stated in this form, examples being the entropy-linear programming, the ridge regression, the elastic net, the regularized optimal transport, etc. We extend the Fast Gradient Method applied to the dual problem in order to make it primal-dual so that it allows not only to solve the dual problem, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02970","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":"1605.02970","created_at":"2026-05-18T01:15:08.019523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02970v1","created_at":"2026-05-18T01:15:08.019523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02970","created_at":"2026-05-18T01:15:08.019523+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPTVQO4HTO66","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPTVQO4HTO66DU32","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPTVQO4H","created_at":"2026-05-18T12:30:29.479603+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/LPTVQO4HTO66DU32SOXRMORE22","json":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22.json","graph_json":"https://pith.science/api/pith-number/LPTVQO4HTO66DU32SOXRMORE22/graph.json","events_json":"https://pith.science/api/pith-number/LPTVQO4HTO66DU32SOXRMORE22/events.json","paper":"https://pith.science/paper/LPTVQO4H"},"agent_actions":{"view_html":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22","download_json":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22.json","view_paper":"https://pith.science/paper/LPTVQO4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02970&json=true","fetch_graph":"https://pith.science/api/pith-number/LPTVQO4HTO66DU32SOXRMORE22/graph.json","fetch_events":"https://pith.science/api/pith-number/LPTVQO4HTO66DU32SOXRMORE22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/action/storage_attestation","attest_author":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/action/author_attestation","sign_citation":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/action/citation_signature","submit_replication":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/action/replication_record"}},"created_at":"2026-05-18T01:15:08.019523+00:00","updated_at":"2026-05-18T01:15:08.019523+00:00"}