{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7NRVEVXPYXFWW7RSX7XBGSEYLU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"084be150738cb910e4d10fe8f11ba3fdb0aa885a8f2ad0c0b30d8fdb0db84963","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-09T11:40:11Z","title_canon_sha256":"f2234f7cea4ed94bc70c1f8ba20ee0f8eda8f3c53fdbc439f4e28636370c5536"},"schema_version":"1.0","source":{"id":"1906.03622","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03622","created_at":"2026-07-05T03:14:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03622v5","created_at":"2026-07-05T03:14:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03622","created_at":"2026-07-05T03:14:44Z"},{"alias_kind":"pith_short_12","alias_value":"7NRVEVXPYXFW","created_at":"2026-07-05T03:14:44Z"},{"alias_kind":"pith_short_16","alias_value":"7NRVEVXPYXFWW7RS","created_at":"2026-07-05T03:14:44Z"},{"alias_kind":"pith_short_8","alias_value":"7NRVEVXP","created_at":"2026-07-05T03:14:44Z"}],"graph_snapshots":[{"event_id":"sha256:f75c10cf12d7c150efd4e1aa814cc982f79024533a6ee46511920ff915fbca08","target":"graph","created_at":"2026-07-05T03:14:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1906.03622/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Alternating minimization (AM) procedures are practically efficient in many applications for solving convex and non-convex optimization problems. On the other hand, Nesterov's accelerated gradient is theoretically optimal first-order method for convex optimization. In this paper we combine AM and Nesterov's acceleration to propose an accelerated alternating minimization algorithm. We prove $1/k^2$ convergence rate in terms of the objective for convex problems and $1/k$ in terms of the squared gradient norm for non-convex problems, where $k$ is the iteration counter. Our method does not require ","authors_text":"Alexander Gasnikov, Nazarii Tupitsa, Pavel Dvurechensky, Sergey Guminov","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-09T11:40:11Z","title":"On a Combination of Alternating Minimization and Nesterov's Momentum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03622","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6595797239cc2f135a3dd620454184ef0472f9e667758e50cab288969c76c20","target":"record","created_at":"2026-07-05T03:14:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"084be150738cb910e4d10fe8f11ba3fdb0aa885a8f2ad0c0b30d8fdb0db84963","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-09T11:40:11Z","title_canon_sha256":"f2234f7cea4ed94bc70c1f8ba20ee0f8eda8f3c53fdbc439f4e28636370c5536"},"schema_version":"1.0","source":{"id":"1906.03622","kind":"arxiv","version":5}},"canonical_sha256":"fb635256efc5cb6b7e32bfee1348985d1a6afc7d7aa91d3be15bcacbabf1c9b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb635256efc5cb6b7e32bfee1348985d1a6afc7d7aa91d3be15bcacbabf1c9b7","first_computed_at":"2026-07-05T03:14:44.622984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:14:44.622984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iFkjH8EgD19jLrvM/02xuUvSvYmIAeu5iRgkxy+Liv4xVP/ujmgG7UHE8EwQwJJn5gby5+JDwh5jyEzRsGTMBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:14:44.623418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03622","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6595797239cc2f135a3dd620454184ef0472f9e667758e50cab288969c76c20","sha256:f75c10cf12d7c150efd4e1aa814cc982f79024533a6ee46511920ff915fbca08"],"state_sha256":"043b5940917e632e41f5e1e12765b5e205c4b53ee6a19823c25148d447745eef"}