{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WH4P56VXPODSEXDAPLHKGLRRAQ","short_pith_number":"pith:WH4P56VX","schema_version":"1.0","canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","source":{"kind":"arxiv","id":"1807.00387","version":3},"attestation_state":"computed","paper":{"title":"Convergence rates for an inertial algorithm of gradient type associated to a smooth nonconvex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Szil\\'ard Csaba L\\'aszl\\'o","submitted_at":"2018-07-01T20:00:26Z","abstract_excerpt":"We investigate an inertial algorithm of gradient type in connection with the minimization of a nonconvex differentiable function. The algorithm is formulated in the spirit of Nesterov's accelerated convex gradient method. We show that the generated sequences converge to a critical point of the objective function, if a regularization of the objective function satisfies the Kurdyka-{\\L}ojasiewicz property. Further, we provide convergence rates for the generated sequences and the function values formulated in terms of the {\\L}ojasiewicz exponent."},"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":"1807.00387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-07-01T20:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"d0982fbab2203df6f975bd78c1aa3b5c6a7d148db55fdac61f750005e67beda6","abstract_canon_sha256":"f9b4a7543734806e87090672d9bb790d7cfb3d9bf3c9d95bc5bf89e3764b2450"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.395693Z","signature_b64":"zd5SOZDw6or1t81h27qUFVLQ8lIudaG9q/qYH0OogF0e/uxTlbdM3P85SDczDKK5qe1hR4bTVzMQKfjdSFZDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","last_reissued_at":"2026-05-18T00:00:08.395184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.395184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence rates for an inertial algorithm of gradient type associated to a smooth nonconvex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Szil\\'ard Csaba L\\'aszl\\'o","submitted_at":"2018-07-01T20:00:26Z","abstract_excerpt":"We investigate an inertial algorithm of gradient type in connection with the minimization of a nonconvex differentiable function. The algorithm is formulated in the spirit of Nesterov's accelerated convex gradient method. We show that the generated sequences converge to a critical point of the objective function, if a regularization of the objective function satisfies the Kurdyka-{\\L}ojasiewicz property. Further, we provide convergence rates for the generated sequences and the function values formulated in terms of the {\\L}ojasiewicz exponent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00387","kind":"arxiv","version":3},"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":"1807.00387","created_at":"2026-05-18T00:00:08.395289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00387v3","created_at":"2026-05-18T00:00:08.395289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00387","created_at":"2026-05-18T00:00:08.395289+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH4P56VXPODS","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH4P56VXPODSEXDA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH4P56VX","created_at":"2026-05-18T12:32:59.047623+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/WH4P56VXPODSEXDAPLHKGLRRAQ","json":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ.json","graph_json":"https://pith.science/api/pith-number/WH4P56VXPODSEXDAPLHKGLRRAQ/graph.json","events_json":"https://pith.science/api/pith-number/WH4P56VXPODSEXDAPLHKGLRRAQ/events.json","paper":"https://pith.science/paper/WH4P56VX"},"agent_actions":{"view_html":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ","download_json":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ.json","view_paper":"https://pith.science/paper/WH4P56VX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00387&json=true","fetch_graph":"https://pith.science/api/pith-number/WH4P56VXPODSEXDAPLHKGLRRAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WH4P56VXPODSEXDAPLHKGLRRAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/action/storage_attestation","attest_author":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/action/author_attestation","sign_citation":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/action/citation_signature","submit_replication":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/action/replication_record"}},"created_at":"2026-05-18T00:00:08.395289+00:00","updated_at":"2026-05-18T00:00:08.395289+00:00"}