{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UU2NZSL4EYQY4H6J4P3CIXCZKN","short_pith_number":"pith:UU2NZSL4","schema_version":"1.0","canonical_sha256":"a534dcc97c26218e1fc9e3f6245c59534e312bbbbd55485fa1c6fd4ae97a45ab","source":{"kind":"arxiv","id":"2210.07644","version":1},"attestation_state":"computed","paper":{"title":"Efficient Regularized Proximal Quasi-Newton Methods for Large-Scale Nonconvex Composite Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Kanzow, Theresa Lechner","submitted_at":"2022-10-14T08:53:48Z","abstract_excerpt":"Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their generalizations like proximal Newton and quasi-Newton methods. In this paper, we propose a regularized proximal quasi-Newton method whose main features are: (a) the method is globally convergent to stationary points, (b) the globalization is controlled by a regularization parameter, no line search is required, (c) the method can be implemented very efficientl"},"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":"2210.07644","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-10-14T08:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"72a065e828528a3d910ef198c7b727e3726f9b5e7b1a8b02630494925fc517d6","abstract_canon_sha256":"d62994bd6e1be55b9bd6bac44e59bb31292911b411c4b0da6ab02ddbb081f849"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:39.655481Z","signature_b64":"sZGOXaRLCtJaJoJbMMMChiLnKKizjT6r1cEDwdcB6MN2xfLX67vJXBoogywGGvqlnRKp2n7UauENMYb3fBSeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a534dcc97c26218e1fc9e3f6245c59534e312bbbbd55485fa1c6fd4ae97a45ab","last_reissued_at":"2026-07-05T05:06:39.655142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:39.655142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Regularized Proximal Quasi-Newton Methods for Large-Scale Nonconvex Composite Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Kanzow, Theresa Lechner","submitted_at":"2022-10-14T08:53:48Z","abstract_excerpt":"Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their generalizations like proximal Newton and quasi-Newton methods. In this paper, we propose a regularized proximal quasi-Newton method whose main features are: (a) the method is globally convergent to stationary points, (b) the globalization is controlled by a regularization parameter, no line search is required, (c) the method can be implemented very efficientl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.07644","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.07644/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":"2210.07644","created_at":"2026-07-05T05:06:39.655196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.07644v1","created_at":"2026-07-05T05:06:39.655196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.07644","created_at":"2026-07-05T05:06:39.655196+00:00"},{"alias_kind":"pith_short_12","alias_value":"UU2NZSL4EYQY","created_at":"2026-07-05T05:06:39.655196+00:00"},{"alias_kind":"pith_short_16","alias_value":"UU2NZSL4EYQY4H6J","created_at":"2026-07-05T05:06:39.655196+00:00"},{"alias_kind":"pith_short_8","alias_value":"UU2NZSL4","created_at":"2026-07-05T05:06:39.655196+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":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN","json":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN.json","graph_json":"https://pith.science/api/pith-number/UU2NZSL4EYQY4H6J4P3CIXCZKN/graph.json","events_json":"https://pith.science/api/pith-number/UU2NZSL4EYQY4H6J4P3CIXCZKN/events.json","paper":"https://pith.science/paper/UU2NZSL4"},"agent_actions":{"view_html":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN","download_json":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN.json","view_paper":"https://pith.science/paper/UU2NZSL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.07644&json=true","fetch_graph":"https://pith.science/api/pith-number/UU2NZSL4EYQY4H6J4P3CIXCZKN/graph.json","fetch_events":"https://pith.science/api/pith-number/UU2NZSL4EYQY4H6J4P3CIXCZKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN/action/storage_attestation","attest_author":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN/action/author_attestation","sign_citation":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN/action/citation_signature","submit_replication":"https://pith.science/pith/UU2NZSL4EYQY4H6J4P3CIXCZKN/action/replication_record"}},"created_at":"2026-07-05T05:06:39.655196+00:00","updated_at":"2026-07-05T05:06:39.655196+00:00"}