{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ATA5DM53JWFNXO4WLWKQRZ36DD","short_pith_number":"pith:ATA5DM53","schema_version":"1.0","canonical_sha256":"04c1d1b3bb4d8adbbb965d9508e77e18d3f67273e19c2aa821391ce41c0d348f","source":{"kind":"arxiv","id":"1811.03831","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"math.OC","authors_text":"B. Morini, G. Gurioli, Ph.L. Toint, S. Bellavia","submitted_at":"2018-11-09T09:39:53Z","abstract_excerpt":"A regularization algorithm using inexact function values and inexact derivatives is proposed and its evaluation complexity analyzed. This algorithm is applicable to unconstrained problems and to problems with inexpensive constraints (that is constraints whose evaluation and enforcement has negligible cost) under the assumption that the derivative of highest degree is $\\beta$-H\\\"{o}lder continuous. It features a very flexible adaptive mechanism for determining the inexactness which is allowed, at each iteration, when computing objective function values and derivatives. The complexity analysis c"},"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.03831","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-09T09:39:53Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"8963f7fb2e86fa8134437d3eb8fb68ac3960a6b8dd6a9a2964f00cf778d89c01","abstract_canon_sha256":"8707cfe0945bca092b97093f8ca474b0e4591678117e7229456ff841f0f707e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:11.299791Z","signature_b64":"lJ9yvU3wQ6ILT2TUadhR1JCZpVtPmXedNXxfhUTj7KB83xC2UopIO7uYO+f8kHOtzsIvB97FCcSoRdG7DQs9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c1d1b3bb4d8adbbb965d9508e77e18d3f67273e19c2aa821391ce41c0d348f","last_reissued_at":"2026-05-17T23:48:11.299116Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:11.299116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"math.OC","authors_text":"B. Morini, G. Gurioli, Ph.L. Toint, S. Bellavia","submitted_at":"2018-11-09T09:39:53Z","abstract_excerpt":"A regularization algorithm using inexact function values and inexact derivatives is proposed and its evaluation complexity analyzed. This algorithm is applicable to unconstrained problems and to problems with inexpensive constraints (that is constraints whose evaluation and enforcement has negligible cost) under the assumption that the derivative of highest degree is $\\beta$-H\\\"{o}lder continuous. It features a very flexible adaptive mechanism for determining the inexactness which is allowed, at each iteration, when computing objective function values and derivatives. The complexity analysis c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03831","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":"1811.03831","created_at":"2026-05-17T23:48:11.299223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03831v3","created_at":"2026-05-17T23:48:11.299223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03831","created_at":"2026-05-17T23:48:11.299223+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATA5DM53JWFN","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATA5DM53JWFNXO4W","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATA5DM53","created_at":"2026-05-18T12:32:13.499390+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/ATA5DM53JWFNXO4WLWKQRZ36DD","json":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD.json","graph_json":"https://pith.science/api/pith-number/ATA5DM53JWFNXO4WLWKQRZ36DD/graph.json","events_json":"https://pith.science/api/pith-number/ATA5DM53JWFNXO4WLWKQRZ36DD/events.json","paper":"https://pith.science/paper/ATA5DM53"},"agent_actions":{"view_html":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD","download_json":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD.json","view_paper":"https://pith.science/paper/ATA5DM53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03831&json=true","fetch_graph":"https://pith.science/api/pith-number/ATA5DM53JWFNXO4WLWKQRZ36DD/graph.json","fetch_events":"https://pith.science/api/pith-number/ATA5DM53JWFNXO4WLWKQRZ36DD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD/action/storage_attestation","attest_author":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD/action/author_attestation","sign_citation":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD/action/citation_signature","submit_replication":"https://pith.science/pith/ATA5DM53JWFNXO4WLWKQRZ36DD/action/replication_record"}},"created_at":"2026-05-17T23:48:11.299223+00:00","updated_at":"2026-05-17T23:48:11.299223+00:00"}