{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V4PRWWL2BVXNP7KB76FC5BYHBP","short_pith_number":"pith:V4PRWWL2","schema_version":"1.0","canonical_sha256":"af1f1b597a0d6ed7fd41ff8a2e87070bd14b6e0cfa900efd7abc22047c722839","source":{"kind":"arxiv","id":"1707.07403","version":1},"attestation_state":"computed","paper":{"title":"Self-concordant inclusions: A unified framework for path-following generalized Newton-type algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Quoc Tran-Dinh, Shu Lu, Tianxiao Sun","submitted_at":"2017-07-24T04:41:50Z","abstract_excerpt":"We study a class of monotone inclusions called \"self-concordant inclusion\" which covers three fundamental convex optimization formulations as special cases. We develop a new generalized Newton-type framework to solve this inclusion. Our framework subsumes three schemes: full-step, damped-step and path-following methods as specific instances, while allows one to use inexact computation to form generalized Newton directions. We prove a local quadratic convergence of both the full-step and damped-step algorithms. Then, we propose a new two-phase inexact path-following scheme for solving this mono"},"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":"1707.07403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-24T04:41:50Z","cross_cats_sorted":[],"title_canon_sha256":"aa5bfb40dc1e149cf1429244ff7824cd85960940f44fe7dd7b1dee6e4084d8f5","abstract_canon_sha256":"2cb3c014056b74af1b21ebc953f9483453a6672fcb3af9d2daed19010c15995c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:42.346635Z","signature_b64":"3RFr2S51ni+tZtfYcWNnOOiIyTGthnqj4fHVpZrDDNGOIcuHmoQO4LSxJmIziuQWRvQ9vu3LoiNSbdIUB92gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af1f1b597a0d6ed7fd41ff8a2e87070bd14b6e0cfa900efd7abc22047c722839","last_reissued_at":"2026-05-18T00:39:42.346078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:42.346078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-concordant inclusions: A unified framework for path-following generalized Newton-type algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Quoc Tran-Dinh, Shu Lu, Tianxiao Sun","submitted_at":"2017-07-24T04:41:50Z","abstract_excerpt":"We study a class of monotone inclusions called \"self-concordant inclusion\" which covers three fundamental convex optimization formulations as special cases. We develop a new generalized Newton-type framework to solve this inclusion. Our framework subsumes three schemes: full-step, damped-step and path-following methods as specific instances, while allows one to use inexact computation to form generalized Newton directions. We prove a local quadratic convergence of both the full-step and damped-step algorithms. Then, we propose a new two-phase inexact path-following scheme for solving this mono"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07403","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":"1707.07403","created_at":"2026-05-18T00:39:42.346164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07403v1","created_at":"2026-05-18T00:39:42.346164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07403","created_at":"2026-05-18T00:39:42.346164+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4PRWWL2BVXN","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4PRWWL2BVXNP7KB","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4PRWWL2","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP","json":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP.json","graph_json":"https://pith.science/api/pith-number/V4PRWWL2BVXNP7KB76FC5BYHBP/graph.json","events_json":"https://pith.science/api/pith-number/V4PRWWL2BVXNP7KB76FC5BYHBP/events.json","paper":"https://pith.science/paper/V4PRWWL2"},"agent_actions":{"view_html":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP","download_json":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP.json","view_paper":"https://pith.science/paper/V4PRWWL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07403&json=true","fetch_graph":"https://pith.science/api/pith-number/V4PRWWL2BVXNP7KB76FC5BYHBP/graph.json","fetch_events":"https://pith.science/api/pith-number/V4PRWWL2BVXNP7KB76FC5BYHBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP/action/storage_attestation","attest_author":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP/action/author_attestation","sign_citation":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP/action/citation_signature","submit_replication":"https://pith.science/pith/V4PRWWL2BVXNP7KB76FC5BYHBP/action/replication_record"}},"created_at":"2026-05-18T00:39:42.346164+00:00","updated_at":"2026-05-18T00:39:42.346164+00:00"}