{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EURNXX3O2XJSTMDNVMNBET2IXE","short_pith_number":"pith:EURNXX3O","schema_version":"1.0","canonical_sha256":"2522dbdf6ed5d329b06dab1a124f48b902c8c521728dd82d27b9fe25c43d498d","source":{"kind":"arxiv","id":"1811.07057","version":1},"attestation_state":"computed","paper":{"title":"Universal regularization methods - varying the power, the smoothness and the accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Nicholas I.M. Gould, Philippe L. Toint","submitted_at":"2018-11-16T22:59:31Z","abstract_excerpt":"Adaptive cubic regularization methods have emerged as a credible alternative to linesearch and trust-region for smooth nonconvex optimization, with optimal complexity amongst second-order methods. Here we consider a general/new class of adaptive regularization methods, that use first- or higher-order local Taylor models of the objective regularized by a(ny) power of the step size and applied to convexly-constrained optimization problems. We investigate the worst-case evaluation complexity/global rate of convergence of these algorithms, when the level of sufficient smoothness of the objective m"},"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":"1811.07057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-16T22:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"95f99fc88577cefdf7e29086097c775eb6f813023078c3152ebeeac0f052fdda","abstract_canon_sha256":"2f29557a9e87e6a9362cd44d2d5b1a9b58ba654c32f522141fca69d82fcb44d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:29.125355Z","signature_b64":"rEcjLlWu6d2LZQ6Eh/8dWBneFLp/CjGq83OAqgrFWvUehOi6s21GBvGT95N637J02BOFsGqlYuCDRiBlI867AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2522dbdf6ed5d329b06dab1a124f48b902c8c521728dd82d27b9fe25c43d498d","last_reissued_at":"2026-05-18T00:00:29.124619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:29.124619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal regularization methods - varying the power, the smoothness and the accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Nicholas I.M. Gould, Philippe L. Toint","submitted_at":"2018-11-16T22:59:31Z","abstract_excerpt":"Adaptive cubic regularization methods have emerged as a credible alternative to linesearch and trust-region for smooth nonconvex optimization, with optimal complexity amongst second-order methods. Here we consider a general/new class of adaptive regularization methods, that use first- or higher-order local Taylor models of the objective regularized by a(ny) power of the step size and applied to convexly-constrained optimization problems. We investigate the worst-case evaluation complexity/global rate of convergence of these algorithms, when the level of sufficient smoothness of the objective m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07057","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":"1811.07057","created_at":"2026-05-18T00:00:29.124745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07057v1","created_at":"2026-05-18T00:00:29.124745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07057","created_at":"2026-05-18T00:00:29.124745+00:00"},{"alias_kind":"pith_short_12","alias_value":"EURNXX3O2XJS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EURNXX3O2XJSTMDN","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EURNXX3O","created_at":"2026-05-18T12:32:22.470017+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/EURNXX3O2XJSTMDNVMNBET2IXE","json":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE.json","graph_json":"https://pith.science/api/pith-number/EURNXX3O2XJSTMDNVMNBET2IXE/graph.json","events_json":"https://pith.science/api/pith-number/EURNXX3O2XJSTMDNVMNBET2IXE/events.json","paper":"https://pith.science/paper/EURNXX3O"},"agent_actions":{"view_html":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE","download_json":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE.json","view_paper":"https://pith.science/paper/EURNXX3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07057&json=true","fetch_graph":"https://pith.science/api/pith-number/EURNXX3O2XJSTMDNVMNBET2IXE/graph.json","fetch_events":"https://pith.science/api/pith-number/EURNXX3O2XJSTMDNVMNBET2IXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE/action/storage_attestation","attest_author":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE/action/author_attestation","sign_citation":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE/action/citation_signature","submit_replication":"https://pith.science/pith/EURNXX3O2XJSTMDNVMNBET2IXE/action/replication_record"}},"created_at":"2026-05-18T00:00:29.124745+00:00","updated_at":"2026-05-18T00:00:29.124745+00:00"}