{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4XSSFS2RWRQ6HYBAB6VFPSUSVT","short_pith_number":"pith:4XSSFS2R","schema_version":"1.0","canonical_sha256":"e5e522cb51b461e3e0200faa57ca92acd4d525208bc0e987cb1326c4d9022527","source":{"kind":"arxiv","id":"2011.08166","version":2},"attestation_state":"computed","paper":{"title":"A Globally Convergent Proximal Newton-Type Method in Nonsmooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boris S. Mordukhovich, Jin Zhang, Shangzhi Zeng, Xiaoming Yuan","submitted_at":"2020-11-16T18:44:17Z","abstract_excerpt":"The paper proposes and justifies a new algorithm of the proximal Newton type to solve a broad class of nonsmooth composite convex optimization problems without strong convexity assumptions. Based on advanced notions and techniques of variational analysis, we establish implementable results on the global convergence of the proposed algorithm as well as its local convergence with superlinear and quadratic rates. For certain structured problems, the obtained local convergence conditions do not require the local Lipschitz continuity of the corresponding Hessian mappings that is a crucial assumptio"},"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":"2011.08166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-16T18:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"0a2c1fa590d71bea5def8b7cce8295e82c4844d92fc52539168a9f1e7c6a8e75","abstract_canon_sha256":"9bba24d8acc9219413b751fdb0ddfb9393af499956fa8019ef79e5f77aefc573"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:49.185464Z","signature_b64":"4fAOGbIzi6vxDa0m79cGAv/TqybC+uY119BM8vVcr9agIgbFNAd3s33dGKp/506GzFjIpZulfjDrJM1oMe7kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5e522cb51b461e3e0200faa57ca92acd4d525208bc0e987cb1326c4d9022527","last_reissued_at":"2026-07-05T04:00:49.185012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:49.185012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Globally Convergent Proximal Newton-Type Method in Nonsmooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boris S. Mordukhovich, Jin Zhang, Shangzhi Zeng, Xiaoming Yuan","submitted_at":"2020-11-16T18:44:17Z","abstract_excerpt":"The paper proposes and justifies a new algorithm of the proximal Newton type to solve a broad class of nonsmooth composite convex optimization problems without strong convexity assumptions. Based on advanced notions and techniques of variational analysis, we establish implementable results on the global convergence of the proposed algorithm as well as its local convergence with superlinear and quadratic rates. For certain structured problems, the obtained local convergence conditions do not require the local Lipschitz continuity of the corresponding Hessian mappings that is a crucial assumptio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08166","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/2011.08166/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":"2011.08166","created_at":"2026-07-05T04:00:49.185066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.08166v2","created_at":"2026-07-05T04:00:49.185066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08166","created_at":"2026-07-05T04:00:49.185066+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XSSFS2RWRQ6","created_at":"2026-07-05T04:00:49.185066+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XSSFS2RWRQ6HYBA","created_at":"2026-07-05T04:00:49.185066+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XSSFS2R","created_at":"2026-07-05T04:00:49.185066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07055","citing_title":"Identifying the MPC-Liquidity Gradient in High-Quality Data","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT","json":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT.json","graph_json":"https://pith.science/api/pith-number/4XSSFS2RWRQ6HYBAB6VFPSUSVT/graph.json","events_json":"https://pith.science/api/pith-number/4XSSFS2RWRQ6HYBAB6VFPSUSVT/events.json","paper":"https://pith.science/paper/4XSSFS2R"},"agent_actions":{"view_html":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT","download_json":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT.json","view_paper":"https://pith.science/paper/4XSSFS2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.08166&json=true","fetch_graph":"https://pith.science/api/pith-number/4XSSFS2RWRQ6HYBAB6VFPSUSVT/graph.json","fetch_events":"https://pith.science/api/pith-number/4XSSFS2RWRQ6HYBAB6VFPSUSVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT/action/storage_attestation","attest_author":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT/action/author_attestation","sign_citation":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT/action/citation_signature","submit_replication":"https://pith.science/pith/4XSSFS2RWRQ6HYBAB6VFPSUSVT/action/replication_record"}},"created_at":"2026-07-05T04:00:49.185066+00:00","updated_at":"2026-07-05T04:00:49.185066+00:00"}