{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MR5DZW3SSEMMOKJLCSHQLMFRY7","short_pith_number":"pith:MR5DZW3S","schema_version":"1.0","canonical_sha256":"647a3cdb729118c7292b148f05b0b1c7d70f4735639560ebe0ee664055f00cb1","source":{"kind":"arxiv","id":"2208.07095","version":2},"attestation_state":"computed","paper":{"title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fred Roosta, Yang Liu","submitted_at":"2022-08-15T09:53:58Z","abstract_excerpt":"In this paper, we consider variants of Newton-MR algorithm for solving unconstrained, smooth, but non-convex optimization problems. Unlike the overwhelming majority of Newton-type methods, which rely on conjugate gradient algorithm as the primary workhorse for their respective sub-problems, Newton-MR employs minimum residual (MINRES) method. Recently, it has been established that MINRES has inherent ability to detect non-positive curvature directions as soon as they arise and certain useful monotonicity properties will be satisfied before such detection. We leverage these recent results and sh"},"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":"2208.07095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-15T09:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"6591d07b40a185e45908e504c9aa14f8e09a4023b84a842e927c92f0dcb80a62","abstract_canon_sha256":"fbfca1dd71a2d3dfa30e3d7e237c39e7c240c311f4975920ccda683d5df692bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:38.015717Z","signature_b64":"YAbPjNrBnobEDyFf5I5t9Tih/evGPViBanPTmvXs6aCt7mVJjeUqRUrFxlj6Q7aGvQL05qPYY1+kTHibwGTfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"647a3cdb729118c7292b148f05b0b1c7d70f4735639560ebe0ee664055f00cb1","last_reissued_at":"2026-07-05T06:55:38.015257Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:38.015257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fred Roosta, Yang Liu","submitted_at":"2022-08-15T09:53:58Z","abstract_excerpt":"In this paper, we consider variants of Newton-MR algorithm for solving unconstrained, smooth, but non-convex optimization problems. Unlike the overwhelming majority of Newton-type methods, which rely on conjugate gradient algorithm as the primary workhorse for their respective sub-problems, Newton-MR employs minimum residual (MINRES) method. Recently, it has been established that MINRES has inherent ability to detect non-positive curvature directions as soon as they arise and certain useful monotonicity properties will be satisfied before such detection. We leverage these recent results and sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07095","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/2208.07095/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":"2208.07095","created_at":"2026-07-05T06:55:38.015311+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.07095v2","created_at":"2026-07-05T06:55:38.015311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07095","created_at":"2026-07-05T06:55:38.015311+00:00"},{"alias_kind":"pith_short_12","alias_value":"MR5DZW3SSEMM","created_at":"2026-07-05T06:55:38.015311+00:00"},{"alias_kind":"pith_short_16","alias_value":"MR5DZW3SSEMMOKJL","created_at":"2026-07-05T06:55:38.015311+00:00"},{"alias_kind":"pith_short_8","alias_value":"MR5DZW3S","created_at":"2026-07-05T06:55:38.015311+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21425","citing_title":"Achieving Material Robustness via Symmetric Stress Finite Element Discretizations","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7","json":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7.json","graph_json":"https://pith.science/api/pith-number/MR5DZW3SSEMMOKJLCSHQLMFRY7/graph.json","events_json":"https://pith.science/api/pith-number/MR5DZW3SSEMMOKJLCSHQLMFRY7/events.json","paper":"https://pith.science/paper/MR5DZW3S"},"agent_actions":{"view_html":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7","download_json":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7.json","view_paper":"https://pith.science/paper/MR5DZW3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.07095&json=true","fetch_graph":"https://pith.science/api/pith-number/MR5DZW3SSEMMOKJLCSHQLMFRY7/graph.json","fetch_events":"https://pith.science/api/pith-number/MR5DZW3SSEMMOKJLCSHQLMFRY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7/action/storage_attestation","attest_author":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7/action/author_attestation","sign_citation":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7/action/citation_signature","submit_replication":"https://pith.science/pith/MR5DZW3SSEMMOKJLCSHQLMFRY7/action/replication_record"}},"created_at":"2026-07-05T06:55:38.015311+00:00","updated_at":"2026-07-05T06:55:38.015311+00:00"}