{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QIG6SM76SNJTG26L6NVEM7FZUS","short_pith_number":"pith:QIG6SM76","schema_version":"1.0","canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","source":{"kind":"arxiv","id":"0904.1523","version":1},"attestation_state":"computed","paper":{"title":"A projection proximal-point algorithm for l^1-minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.NA","authors_text":"Dirk A. Lorenz","submitted_at":"2009-04-09T12:58:52Z","abstract_excerpt":"The problem of the minimization of least squares functionals with $\\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are only a few of them which come with a proper convergence analysis in the infinite dimensional setting. In this work we provide an algorithm from a class which have not been considered for $\\ell^1$ minimization before, namely a proximal-point method in combination with a projection step. We show that this idea gives a simple and easy to implement algorithm. We p"},"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":"0904.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-04-09T12:58:52Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"cc96abc669823433cb4981f66302e530d0df20f7993d73cd9e94446f049a3514","abstract_canon_sha256":"22dc64f3a7be742c409d3747b4b51bd6df1b1cc9aa83e4f275637f87c6354e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:50.915877Z","signature_b64":"5HWamVq98SY8W7sq5dOzb/lC846JKXGXuFXIKE1KiMR1sBtA+V5E59ROPiLLKZkhqZWfDxnMfNVy2xo1spItCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","last_reissued_at":"2026-05-18T04:38:50.915442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:50.915442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A projection proximal-point algorithm for l^1-minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.NA","authors_text":"Dirk A. Lorenz","submitted_at":"2009-04-09T12:58:52Z","abstract_excerpt":"The problem of the minimization of least squares functionals with $\\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are only a few of them which come with a proper convergence analysis in the infinite dimensional setting. In this work we provide an algorithm from a class which have not been considered for $\\ell^1$ minimization before, namely a proximal-point method in combination with a projection step. We show that this idea gives a simple and easy to implement algorithm. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.1523","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":"0904.1523","created_at":"2026-05-18T04:38:50.915505+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.1523v1","created_at":"2026-05-18T04:38:50.915505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.1523","created_at":"2026-05-18T04:38:50.915505+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIG6SM76SNJT","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIG6SM76SNJTG26L","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIG6SM76","created_at":"2026-05-18T12:26:01.383474+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/QIG6SM76SNJTG26L6NVEM7FZUS","json":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS.json","graph_json":"https://pith.science/api/pith-number/QIG6SM76SNJTG26L6NVEM7FZUS/graph.json","events_json":"https://pith.science/api/pith-number/QIG6SM76SNJTG26L6NVEM7FZUS/events.json","paper":"https://pith.science/paper/QIG6SM76"},"agent_actions":{"view_html":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS","download_json":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS.json","view_paper":"https://pith.science/paper/QIG6SM76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.1523&json=true","fetch_graph":"https://pith.science/api/pith-number/QIG6SM76SNJTG26L6NVEM7FZUS/graph.json","fetch_events":"https://pith.science/api/pith-number/QIG6SM76SNJTG26L6NVEM7FZUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/action/storage_attestation","attest_author":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/action/author_attestation","sign_citation":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/action/citation_signature","submit_replication":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/action/replication_record"}},"created_at":"2026-05-18T04:38:50.915505+00:00","updated_at":"2026-05-18T04:38:50.915505+00:00"}