{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2A5KUE7VZQFV2GEZDJZMZPNBLE","short_pith_number":"pith:2A5KUE7V","schema_version":"1.0","canonical_sha256":"d03aaa13f5cc0b5d18991a72ccbda15934556fa56b1813fecbd436c2a5c637c5","source":{"kind":"arxiv","id":"1902.09001","version":2},"attestation_state":"computed","paper":{"title":"Gradient Methods for Problems with Inexact Model of the Objective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Tyurin, Alexey Kroshnin, Artem Agafonov, C\\'esar A. Uribe, Darina Dvinskikh, Dmitry Pasechnyuk, Fedor Stonyakin, Olesya Kuznetsova, Pavel Dvurechensky, Sergei Artamonov","submitted_at":"2019-02-24T19:50:54Z","abstract_excerpt":"We consider optimization methods for convex minimization problems under inexact information on the objective function. We introduce inexact model of the objective, which as a particular cases includes $(\\delta,L)$ inexact oracle and relative smoothness condition. We analyze gradient method which uses this inexact model and obtain convergence rates for convex and strongly convex problems. To show potential applications of our general framework we consider three particular problems. The first one is clustering by electorial model introduced in [Nesterov, 2018]. The second one is approximating op"},"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":"1902.09001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-24T19:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"a941c63097d78f5ac0ad051c15f63c7f5f96657dad2a3f9213004e682ba3c202","abstract_canon_sha256":"00e968aa535c301540ba624d7df2ed5d068bb7598d7d335e46ef98480d50c8b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:36.008033Z","signature_b64":"t/Br4HVhVWK7OQD6uKjuUcDe7uueR94jg0jJ5q7QAGYESpQfikpB8UXKLI/F5pu2uU3O6wKa8+Zvz3ct+C9VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03aaa13f5cc0b5d18991a72ccbda15934556fa56b1813fecbd436c2a5c637c5","last_reissued_at":"2026-05-17T23:50:36.007403Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:36.007403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Methods for Problems with Inexact Model of the Objective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Tyurin, Alexey Kroshnin, Artem Agafonov, C\\'esar A. Uribe, Darina Dvinskikh, Dmitry Pasechnyuk, Fedor Stonyakin, Olesya Kuznetsova, Pavel Dvurechensky, Sergei Artamonov","submitted_at":"2019-02-24T19:50:54Z","abstract_excerpt":"We consider optimization methods for convex minimization problems under inexact information on the objective function. We introduce inexact model of the objective, which as a particular cases includes $(\\delta,L)$ inexact oracle and relative smoothness condition. We analyze gradient method which uses this inexact model and obtain convergence rates for convex and strongly convex problems. To show potential applications of our general framework we consider three particular problems. The first one is clustering by electorial model introduced in [Nesterov, 2018]. The second one is approximating op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09001","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":""},"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":"1902.09001","created_at":"2026-05-17T23:50:36.007480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09001v2","created_at":"2026-05-17T23:50:36.007480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09001","created_at":"2026-05-17T23:50:36.007480+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A5KUE7VZQFV","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A5KUE7VZQFV2GEZ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A5KUE7V","created_at":"2026-05-18T12:33:07.085635+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/2A5KUE7VZQFV2GEZDJZMZPNBLE","json":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE.json","graph_json":"https://pith.science/api/pith-number/2A5KUE7VZQFV2GEZDJZMZPNBLE/graph.json","events_json":"https://pith.science/api/pith-number/2A5KUE7VZQFV2GEZDJZMZPNBLE/events.json","paper":"https://pith.science/paper/2A5KUE7V"},"agent_actions":{"view_html":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE","download_json":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE.json","view_paper":"https://pith.science/paper/2A5KUE7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09001&json=true","fetch_graph":"https://pith.science/api/pith-number/2A5KUE7VZQFV2GEZDJZMZPNBLE/graph.json","fetch_events":"https://pith.science/api/pith-number/2A5KUE7VZQFV2GEZDJZMZPNBLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE/action/storage_attestation","attest_author":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE/action/author_attestation","sign_citation":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE/action/citation_signature","submit_replication":"https://pith.science/pith/2A5KUE7VZQFV2GEZDJZMZPNBLE/action/replication_record"}},"created_at":"2026-05-17T23:50:36.007480+00:00","updated_at":"2026-05-17T23:50:36.007480+00:00"}