{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NOWSORFJMW4NWZZTDX4NMFZTNZ","short_pith_number":"pith:NOWSORFJ","schema_version":"1.0","canonical_sha256":"6bad2744a965b8db67331df8d617336e5bfaa275cf75d588665991517bbc85da","source":{"kind":"arxiv","id":"1907.11742","version":1},"attestation_state":"computed","paper":{"title":"A simple Newton method for local nonsmooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrian Lewis, Calvin Wylie","submitted_at":"2019-07-26T18:29:51Z","abstract_excerpt":"Superlinear convergence has been an elusive goal for black-box nonsmooth optimization. Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular in practice, local convergence is still sluggish. Faster variants depend either on problem structure or on analyses that elide sequences of \"null\" steps. Motivated by a semi-structured approach to optimization and the sequential quadratic programming philosophy, we describe a new bundle Newton method that incorporates second-order objective information with "},"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":"1907.11742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-26T18:29:51Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"c0016ec47f3182967af64d5ef1b05d244e24bf1691c58661081e3fc5177eaaab","abstract_canon_sha256":"d7fc9c4ec370086a62ec14085fec8bacc87fa0a7df4d9c8ff81c8b643183d3a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:23.223179Z","signature_b64":"p820U7sbPScV86DD0LhvgVhQ7VN598cuof4HEqP9IdtzoP6XbnWlrZSO9vlbBz0a4F0vHC4bUGbZgiU5XEIfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bad2744a965b8db67331df8d617336e5bfaa275cf75d588665991517bbc85da","last_reissued_at":"2026-05-17T23:39:23.222433Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:23.222433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple Newton method for local nonsmooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrian Lewis, Calvin Wylie","submitted_at":"2019-07-26T18:29:51Z","abstract_excerpt":"Superlinear convergence has been an elusive goal for black-box nonsmooth optimization. Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular in practice, local convergence is still sluggish. Faster variants depend either on problem structure or on analyses that elide sequences of \"null\" steps. Motivated by a semi-structured approach to optimization and the sequential quadratic programming philosophy, we describe a new bundle Newton method that incorporates second-order objective information with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11742","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":""},"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":"1907.11742","created_at":"2026-05-17T23:39:23.222562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11742v1","created_at":"2026-05-17T23:39:23.222562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11742","created_at":"2026-05-17T23:39:23.222562+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOWSORFJMW4N","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOWSORFJMW4NWZZT","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOWSORFJ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.03296","citing_title":"Technical results on the convergence of quasi-Newton methods for nonsmooth optimization","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ","json":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ.json","graph_json":"https://pith.science/api/pith-number/NOWSORFJMW4NWZZTDX4NMFZTNZ/graph.json","events_json":"https://pith.science/api/pith-number/NOWSORFJMW4NWZZTDX4NMFZTNZ/events.json","paper":"https://pith.science/paper/NOWSORFJ"},"agent_actions":{"view_html":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ","download_json":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ.json","view_paper":"https://pith.science/paper/NOWSORFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11742&json=true","fetch_graph":"https://pith.science/api/pith-number/NOWSORFJMW4NWZZTDX4NMFZTNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NOWSORFJMW4NWZZTDX4NMFZTNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ/action/storage_attestation","attest_author":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ/action/author_attestation","sign_citation":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ/action/citation_signature","submit_replication":"https://pith.science/pith/NOWSORFJMW4NWZZTDX4NMFZTNZ/action/replication_record"}},"created_at":"2026-05-17T23:39:23.222562+00:00","updated_at":"2026-05-17T23:39:23.222562+00:00"}