{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6RYOOUAS3TF42RJTR33MGTEJMS","short_pith_number":"pith:6RYOOUAS","schema_version":"1.0","canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","source":{"kind":"arxiv","id":"2412.02079","version":3},"attestation_state":"computed","paper":{"title":"A simple and practical adaptive trust-region method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fadi Hamad, Oliver Hinder","submitted_at":"2024-12-03T01:48:27Z","abstract_excerpt":"We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of \\citet{sorensen1982newton}. The method achieves the best possible convergence bound up to an additive log factor, for finding an $\\epsilon$-approximate stationary point, i.e., $O( \\Delta_f L^{1/2} \\epsilon^{-3/2}) + \\tilde{O}(1)$ iterations where $L$ is the Lipschitz constant of the Hessian, $\\Delta_f$ is the optimality gap, and $\\epsilon$ is the termination tolerance for the gradient norm"},"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":"2412.02079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T01:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"cd21c20ec19b8c5888fb8ee6dad020e282ec124a076d71cf8ba8d44182a3d409","abstract_canon_sha256":"08b5a554e3189b699fe33fb4153697b53dd04c5db7e3f52950bdc714d3fcb860"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:09.549968Z","signature_b64":"L+NuA4I2a9M+beR+Dfs36jANI7KKoyAG6iikX1V/wzxZiKZIXBSV85hwJDHhRTbYfAP5sYJ7s/S0JhlbGDt6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","last_reissued_at":"2026-07-05T11:59:09.549495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:09.549495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple and practical adaptive trust-region method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fadi Hamad, Oliver Hinder","submitted_at":"2024-12-03T01:48:27Z","abstract_excerpt":"We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of \\citet{sorensen1982newton}. The method achieves the best possible convergence bound up to an additive log factor, for finding an $\\epsilon$-approximate stationary point, i.e., $O( \\Delta_f L^{1/2} \\epsilon^{-3/2}) + \\tilde{O}(1)$ iterations where $L$ is the Lipschitz constant of the Hessian, $\\Delta_f$ is the optimality gap, and $\\epsilon$ is the termination tolerance for the gradient norm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02079","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.02079/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.02079","created_at":"2026-07-05T11:59:09.549548+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.02079v3","created_at":"2026-07-05T11:59:09.549548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02079","created_at":"2026-07-05T11:59:09.549548+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RYOOUAS3TF4","created_at":"2026-07-05T11:59:09.549548+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RYOOUAS3TF42RJT","created_at":"2026-07-05T11:59:09.549548+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RYOOUAS","created_at":"2026-07-05T11:59:09.549548+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.19647","citing_title":"On the Universality of Simple Trust-Region Algorithms","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS","json":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS.json","graph_json":"https://pith.science/api/pith-number/6RYOOUAS3TF42RJTR33MGTEJMS/graph.json","events_json":"https://pith.science/api/pith-number/6RYOOUAS3TF42RJTR33MGTEJMS/events.json","paper":"https://pith.science/paper/6RYOOUAS"},"agent_actions":{"view_html":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS","download_json":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS.json","view_paper":"https://pith.science/paper/6RYOOUAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.02079&json=true","fetch_graph":"https://pith.science/api/pith-number/6RYOOUAS3TF42RJTR33MGTEJMS/graph.json","fetch_events":"https://pith.science/api/pith-number/6RYOOUAS3TF42RJTR33MGTEJMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/action/storage_attestation","attest_author":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/action/author_attestation","sign_citation":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/action/citation_signature","submit_replication":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/action/replication_record"}},"created_at":"2026-07-05T11:59:09.549548+00:00","updated_at":"2026-07-05T11:59:09.549548+00:00"}