{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AIZY3CG6XHBEZT2CDHWS4OKB4B","short_pith_number":"pith:AIZY3CG6","schema_version":"1.0","canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","source":{"kind":"arxiv","id":"1804.09385","version":1},"attestation_state":"computed","paper":{"title":"Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jiajun Xiong, Jigen Peng, Meng Wen","submitted_at":"2018-04-25T06:58:09Z","abstract_excerpt":"Recently, the $\\l_{p}$-norm regularization minimization problem $(P_{p}^{\\lambda})$ has attracted great attention in compressed sensing. However, the $\\l_{p}$-norm $\\|x\\|_{p}^{p}$ in problem $(P_{p}^{\\lambda})$ is nonconvex and non-Lipschitz for all $p\\in(0,1)$, and there are not many optimization theories and methods are proposed to solve this problem. In fact, it is NP-hard for all $p\\in(0,1)$ and $\\lambda>0$. In this paper, we study two modified $\\l_{p}$ regularization minimization problems to approximate the NP-hard problem $(P_{p}^{\\lambda})$. Inspired by the good performance of Half algo"},"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":"1804.09385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-25T06:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"df964bbbf2f2554e397da7e01eaba03e3b03e057dec2fb76b5d7ce8a0ef1d871","abstract_canon_sha256":"c2cea77734c8d3376aa3dceb152fc3ff68832c2fb89a85817cff9d666a1e58ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.988010Z","signature_b64":"7ICh3OLHQAgVi/scAp8clbtS/EGsSNqml8Bx3Yv6mV9pPFC3yLpVrtU4Fp+nsuhRc/MpXGw/J9Io2Iw55lCTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02338d88deb9c24ccf4219ed2e3941e04993f3e90f6b54dea53a86fadf91140c","last_reissued_at":"2026-05-18T00:17:31.987463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.987463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jiajun Xiong, Jigen Peng, Meng Wen","submitted_at":"2018-04-25T06:58:09Z","abstract_excerpt":"Recently, the $\\l_{p}$-norm regularization minimization problem $(P_{p}^{\\lambda})$ has attracted great attention in compressed sensing. However, the $\\l_{p}$-norm $\\|x\\|_{p}^{p}$ in problem $(P_{p}^{\\lambda})$ is nonconvex and non-Lipschitz for all $p\\in(0,1)$, and there are not many optimization theories and methods are proposed to solve this problem. In fact, it is NP-hard for all $p\\in(0,1)$ and $\\lambda>0$. In this paper, we study two modified $\\l_{p}$ regularization minimization problems to approximate the NP-hard problem $(P_{p}^{\\lambda})$. Inspired by the good performance of Half algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09385","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":"1804.09385","created_at":"2026-05-18T00:17:31.987548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09385v1","created_at":"2026-05-18T00:17:31.987548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09385","created_at":"2026-05-18T00:17:31.987548+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIZY3CG6XHBE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIZY3CG6XHBEZT2C","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIZY3CG6","created_at":"2026-05-18T12:32:13.499390+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/AIZY3CG6XHBEZT2CDHWS4OKB4B","json":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B.json","graph_json":"https://pith.science/api/pith-number/AIZY3CG6XHBEZT2CDHWS4OKB4B/graph.json","events_json":"https://pith.science/api/pith-number/AIZY3CG6XHBEZT2CDHWS4OKB4B/events.json","paper":"https://pith.science/paper/AIZY3CG6"},"agent_actions":{"view_html":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B","download_json":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B.json","view_paper":"https://pith.science/paper/AIZY3CG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09385&json=true","fetch_graph":"https://pith.science/api/pith-number/AIZY3CG6XHBEZT2CDHWS4OKB4B/graph.json","fetch_events":"https://pith.science/api/pith-number/AIZY3CG6XHBEZT2CDHWS4OKB4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/action/storage_attestation","attest_author":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/action/author_attestation","sign_citation":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/action/citation_signature","submit_replication":"https://pith.science/pith/AIZY3CG6XHBEZT2CDHWS4OKB4B/action/replication_record"}},"created_at":"2026-05-18T00:17:31.987548+00:00","updated_at":"2026-05-18T00:17:31.987548+00:00"}