{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3UXS7L7IP3W3EK6ND33CG2EIOH","short_pith_number":"pith:3UXS7L7I","schema_version":"1.0","canonical_sha256":"dd2f2fafe87eedb22bcd1ef623688871d23187d079275b2ca184f4a7d293f8c6","source":{"kind":"arxiv","id":"1905.11904","version":2},"attestation_state":"computed","paper":{"title":"A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas Themelis, Masoud Ahookhosh, Panagiotis Patrinos","submitted_at":"2019-05-28T16:03:49Z","abstract_excerpt":"We introduce Bella, a locally superlinearly convergent Bregman forward backward splitting method for minimizing the sum of two nonconvex functions, one of which satisfying a relative smoothness condition and the other one possibly nonsmooth. A key tool of our methodology is the Bregman forward-backward envelope (BFBE), an exact and continuous penalty function with favorable first- and second-order properties, and enjoying a nonlinear error bound when the objective function satisfies a Lojasiewicz-type property. The proposed algorithm is of linesearch type over the BFBE along candidate update d"},"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":"1905.11904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-28T16:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"3fae8c5c7b6ca7a36bf0ec6524b6fdd9e880c92e9a3e8f0abbdfdc81eed23a02","abstract_canon_sha256":"3503629f7cd3b3f523d9c4440beadf1e9c74e3b882606931648c5f4b87a8a554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:14.261621Z","signature_b64":"90ykyifDsk2uGp+/AqlXSWyPbGG2N3cvKWS6V9KJrdpQwQaJ7ZtBXpEe+g4p12Q5yvzLUbT7AFZ2aDmoD77UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd2f2fafe87eedb22bcd1ef623688871d23187d079275b2ca184f4a7d293f8c6","last_reissued_at":"2026-07-05T08:08:14.261231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:14.261231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas Themelis, Masoud Ahookhosh, Panagiotis Patrinos","submitted_at":"2019-05-28T16:03:49Z","abstract_excerpt":"We introduce Bella, a locally superlinearly convergent Bregman forward backward splitting method for minimizing the sum of two nonconvex functions, one of which satisfying a relative smoothness condition and the other one possibly nonsmooth. A key tool of our methodology is the Bregman forward-backward envelope (BFBE), an exact and continuous penalty function with favorable first- and second-order properties, and enjoying a nonlinear error bound when the objective function satisfies a Lojasiewicz-type property. The proposed algorithm is of linesearch type over the BFBE along candidate update d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11904","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/1905.11904/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":"1905.11904","created_at":"2026-07-05T08:08:14.261285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11904v2","created_at":"2026-07-05T08:08:14.261285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11904","created_at":"2026-07-05T08:08:14.261285+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UXS7L7IP3W3","created_at":"2026-07-05T08:08:14.261285+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UXS7L7IP3W3EK6N","created_at":"2026-07-05T08:08:14.261285+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UXS7L7I","created_at":"2026-07-05T08:08:14.261285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01402","citing_title":"Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH","json":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH.json","graph_json":"https://pith.science/api/pith-number/3UXS7L7IP3W3EK6ND33CG2EIOH/graph.json","events_json":"https://pith.science/api/pith-number/3UXS7L7IP3W3EK6ND33CG2EIOH/events.json","paper":"https://pith.science/paper/3UXS7L7I"},"agent_actions":{"view_html":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH","download_json":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH.json","view_paper":"https://pith.science/paper/3UXS7L7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11904&json=true","fetch_graph":"https://pith.science/api/pith-number/3UXS7L7IP3W3EK6ND33CG2EIOH/graph.json","fetch_events":"https://pith.science/api/pith-number/3UXS7L7IP3W3EK6ND33CG2EIOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH/action/storage_attestation","attest_author":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH/action/author_attestation","sign_citation":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH/action/citation_signature","submit_replication":"https://pith.science/pith/3UXS7L7IP3W3EK6ND33CG2EIOH/action/replication_record"}},"created_at":"2026-07-05T08:08:14.261285+00:00","updated_at":"2026-07-05T08:08:14.261285+00:00"}