{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RMSVQ6KPBBTT6Z7ZAVSI37XOEE","short_pith_number":"pith:RMSVQ6KP","schema_version":"1.0","canonical_sha256":"8b2558794f08673f67f905648dfeee2136c744b3bb77a8211d214db8bcd4fca4","source":{"kind":"arxiv","id":"1511.07837","version":3},"attestation_state":"computed","paper":{"title":"Generalized Conjugate Gradient Methods for $\\ell_1$ Regularized Convex Quadratic Programming with Finite Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Xiaojun Chen, Zhaosong Lu","submitted_at":"2015-11-24T19:28:09Z","abstract_excerpt":"The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\\ell_1$-regularized (possibly not strongly) convex QP that terminate at an optimal solution in a finite number of iterations. At each iteration, our methods first identify a face of an orthant and then either perform an exact line search along the direction of the negative projected minimum-norm subgradient of the objective function or execute a CG subroutine that conducts a sequence o"},"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":"1511.07837","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-24T19:28:09Z","cross_cats_sorted":["cs.LG","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"80d12a90d326cc84574d893071157483950ea4b7735188b5f503ad7c1e0e01ab","abstract_canon_sha256":"d0556c07410a7f8c02f8acd760088e6c56016924715a67e4ba3e3c729c01a5cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.577971Z","signature_b64":"1uDHNJs9d2ZnXEaXiDJDQ6B1bTs0HyCgYCIr+bpTyU0qoOzrnnarpHGpUt6llG0pV916n+tDvdd4tQFngeUsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b2558794f08673f67f905648dfeee2136c744b3bb77a8211d214db8bcd4fca4","last_reissued_at":"2026-05-18T01:20:55.577252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.577252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Conjugate Gradient Methods for $\\ell_1$ Regularized Convex Quadratic Programming with Finite Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Xiaojun Chen, Zhaosong Lu","submitted_at":"2015-11-24T19:28:09Z","abstract_excerpt":"The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\\ell_1$-regularized (possibly not strongly) convex QP that terminate at an optimal solution in a finite number of iterations. At each iteration, our methods first identify a face of an orthant and then either perform an exact line search along the direction of the negative projected minimum-norm subgradient of the objective function or execute a CG subroutine that conducts a sequence o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07837","kind":"arxiv","version":3},"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":"1511.07837","created_at":"2026-05-18T01:20:55.577389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07837v3","created_at":"2026-05-18T01:20:55.577389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07837","created_at":"2026-05-18T01:20:55.577389+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMSVQ6KPBBTT","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMSVQ6KPBBTT6Z7Z","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMSVQ6KP","created_at":"2026-05-18T12:29:39.896362+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/RMSVQ6KPBBTT6Z7ZAVSI37XOEE","json":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE.json","graph_json":"https://pith.science/api/pith-number/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/graph.json","events_json":"https://pith.science/api/pith-number/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/events.json","paper":"https://pith.science/paper/RMSVQ6KP"},"agent_actions":{"view_html":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE","download_json":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE.json","view_paper":"https://pith.science/paper/RMSVQ6KP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07837&json=true","fetch_graph":"https://pith.science/api/pith-number/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/graph.json","fetch_events":"https://pith.science/api/pith-number/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/action/storage_attestation","attest_author":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/action/author_attestation","sign_citation":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/action/citation_signature","submit_replication":"https://pith.science/pith/RMSVQ6KPBBTT6Z7ZAVSI37XOEE/action/replication_record"}},"created_at":"2026-05-18T01:20:55.577389+00:00","updated_at":"2026-05-18T01:20:55.577389+00:00"}