{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4GIDTUX2I7NDYTZDPGQAPADMYR","short_pith_number":"pith:4GIDTUX2","schema_version":"1.0","canonical_sha256":"e19039d2fa47da3c4f2379a007806cc47019ca058d805ae8b35d41c6a6147887","source":{"kind":"arxiv","id":"2410.11676","version":2},"attestation_state":"computed","paper":{"title":"Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jalal Fadili, Peter Ochs, Shida Wang","submitted_at":"2024-10-15T15:12:52Z","abstract_excerpt":"In this paper, we propose two regularized proximal quasi-Newton methods with symmetric rank-1 update of the metric (SR1 quasi-Newton) to solve non-smooth convex additive composite problems. Both algorithms avoid using line search or other trust region strategies. For each of them, we prove a super-linear convergence rate that is independent of the initialization of the algorithm. The cubic regularized method achieves a rate of order $\\left(\\frac{C}{N^{1/2}}\\right)^{N/2}$, where $N$ is the number of iterations and $C$ is some constant, and the other gradient regularized method shows a rate of t"},"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":"2410.11676","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-15T15:12:52Z","cross_cats_sorted":[],"title_canon_sha256":"4525f3d17f742a84100b317a776c2afbdccc72eb8dc3d76325e005c9f8051964","abstract_canon_sha256":"4fb988e68bdde5abbce5f2bfa30f452fe36d210222a0dd1bdd96bf88dd180ad2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:30.521849Z","signature_b64":"uPOw2YuhKiUnoiTjtEC1a1k4/e+AImaiYkiv7k3/VBB+x1Lk9lSqvUPNTxyu00ls+iP92/unU48KiL/hsNWYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e19039d2fa47da3c4f2379a007806cc47019ca058d805ae8b35d41c6a6147887","last_reissued_at":"2026-07-05T09:38:30.521359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:30.521359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jalal Fadili, Peter Ochs, Shida Wang","submitted_at":"2024-10-15T15:12:52Z","abstract_excerpt":"In this paper, we propose two regularized proximal quasi-Newton methods with symmetric rank-1 update of the metric (SR1 quasi-Newton) to solve non-smooth convex additive composite problems. Both algorithms avoid using line search or other trust region strategies. For each of them, we prove a super-linear convergence rate that is independent of the initialization of the algorithm. The cubic regularized method achieves a rate of order $\\left(\\frac{C}{N^{1/2}}\\right)^{N/2}$, where $N$ is the number of iterations and $C$ is some constant, and the other gradient regularized method shows a rate of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.11676","kind":"arxiv","version":2},"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/2410.11676/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":"2410.11676","created_at":"2026-07-05T09:38:30.521413+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.11676v2","created_at":"2026-07-05T09:38:30.521413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11676","created_at":"2026-07-05T09:38:30.521413+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GIDTUX2I7ND","created_at":"2026-07-05T09:38:30.521413+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GIDTUX2I7NDYTZD","created_at":"2026-07-05T09:38:30.521413+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GIDTUX2","created_at":"2026-07-05T09:38:30.521413+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":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR","json":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR.json","graph_json":"https://pith.science/api/pith-number/4GIDTUX2I7NDYTZDPGQAPADMYR/graph.json","events_json":"https://pith.science/api/pith-number/4GIDTUX2I7NDYTZDPGQAPADMYR/events.json","paper":"https://pith.science/paper/4GIDTUX2"},"agent_actions":{"view_html":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR","download_json":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR.json","view_paper":"https://pith.science/paper/4GIDTUX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.11676&json=true","fetch_graph":"https://pith.science/api/pith-number/4GIDTUX2I7NDYTZDPGQAPADMYR/graph.json","fetch_events":"https://pith.science/api/pith-number/4GIDTUX2I7NDYTZDPGQAPADMYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR/action/storage_attestation","attest_author":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR/action/author_attestation","sign_citation":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR/action/citation_signature","submit_replication":"https://pith.science/pith/4GIDTUX2I7NDYTZDPGQAPADMYR/action/replication_record"}},"created_at":"2026-07-05T09:38:30.521413+00:00","updated_at":"2026-07-05T09:38:30.521413+00:00"}