{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I4BZ27AUGCFPFRA24BLO3HGIRE","short_pith_number":"pith:I4BZ27AU","schema_version":"1.0","canonical_sha256":"47039d7c14308af2c41ae056ed9cc88908fee0147163626bcc3c45609c360617","source":{"kind":"arxiv","id":"1902.10406","version":1},"attestation_state":"computed","paper":{"title":"Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"E. Simon, Ph. L. Toint, S. Gratton","submitted_at":"2019-02-27T09:19:09Z","abstract_excerpt":"An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most $O(|\\log(\\epsilon)|\\,\\epsilon^{-2})$ evaluations of the problem's functions and their derivatives for finding an $\\epsilon$-approximate first-order stationary point. This complexity bound therefore generalizes that provided by [Bellavia, Gurioli, Morini and Toint, 2018] for inexact methods for smooth nonconvex problems, and is within a factor $|\\log(\\epsilon)|$ of the optimal bound known"},"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.10406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-27T09:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"78764c9f8c04b817807947de6ab20488b9d86b28d8c07762b619eaf985f04763","abstract_canon_sha256":"62a82751ae66e514dfddf760919135eb1429cc04efc0acde42028a306124f255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:30.935807Z","signature_b64":"R/hx0M+t1gMS7tJwVtFwrEeoc+u5Rmm4Gp/vDpzrZSrbm+7arIL7yawrmH4IcM0GnKKd9kVM/HDXpJCnF3cwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47039d7c14308af2c41ae056ed9cc88908fee0147163626bcc3c45609c360617","last_reissued_at":"2026-05-17T23:52:30.935247Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:30.935247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"E. Simon, Ph. L. Toint, S. Gratton","submitted_at":"2019-02-27T09:19:09Z","abstract_excerpt":"An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most $O(|\\log(\\epsilon)|\\,\\epsilon^{-2})$ evaluations of the problem's functions and their derivatives for finding an $\\epsilon$-approximate first-order stationary point. This complexity bound therefore generalizes that provided by [Bellavia, Gurioli, Morini and Toint, 2018] for inexact methods for smooth nonconvex problems, and is within a factor $|\\log(\\epsilon)|$ of the optimal bound known"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10406","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":"1902.10406","created_at":"2026-05-17T23:52:30.935335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10406v1","created_at":"2026-05-17T23:52:30.935335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10406","created_at":"2026-05-17T23:52:30.935335+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4BZ27AUGCFP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4BZ27AUGCFPFRA2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4BZ27AU","created_at":"2026-05-18T12:33:18.533446+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/I4BZ27AUGCFPFRA24BLO3HGIRE","json":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE.json","graph_json":"https://pith.science/api/pith-number/I4BZ27AUGCFPFRA24BLO3HGIRE/graph.json","events_json":"https://pith.science/api/pith-number/I4BZ27AUGCFPFRA24BLO3HGIRE/events.json","paper":"https://pith.science/paper/I4BZ27AU"},"agent_actions":{"view_html":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE","download_json":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE.json","view_paper":"https://pith.science/paper/I4BZ27AU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10406&json=true","fetch_graph":"https://pith.science/api/pith-number/I4BZ27AUGCFPFRA24BLO3HGIRE/graph.json","fetch_events":"https://pith.science/api/pith-number/I4BZ27AUGCFPFRA24BLO3HGIRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE/action/storage_attestation","attest_author":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE/action/author_attestation","sign_citation":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE/action/citation_signature","submit_replication":"https://pith.science/pith/I4BZ27AUGCFPFRA24BLO3HGIRE/action/replication_record"}},"created_at":"2026-05-17T23:52:30.935335+00:00","updated_at":"2026-05-17T23:52:30.935335+00:00"}