{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2XMX6JXIAYAIFPDHUTY7Y7MB2Y","short_pith_number":"pith:2XMX6JXI","schema_version":"1.0","canonical_sha256":"d5d97f26e8060082bc67a4f1fc7d81d61aacf837e337e1604b502d296699f7ae","source":{"kind":"arxiv","id":"1807.05499","version":3},"attestation_state":"computed","paper":{"title":"Scalable Incremental Nonconvex Optimization Approach for Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongkai Zhao, Jian-Feng Cai, Ji Li","submitted_at":"2018-07-15T06:57:06Z","abstract_excerpt":"We aim to find a solution $\\bm{x}\\in\\mathbb{C}^n$ to a system of quadratic equations of the form $b_i=\\lvert\\bm{a}_i^*\\bm{x}\\rvert^2$, $i=1,2,\\ldots,m$, e.g., the well-known NP-hard phase retrieval problem. As opposed to recently proposed state-of-the-art nonconvex methods, we revert to the semidefinite relaxation (SDR) PhaseLift convex formulation and propose a successive and incremental nonconvex optimization algorithm, termed as \\texttt{IncrePR}, to indirectly minimize the resulting convex problem on the cone of positive semidefinite matrices. Our proposed method overcomes the excessive com"},"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":"1807.05499","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-15T06:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"1d250d117871806d10ed9b5616ad3385b3dbc278a4fbc10e61170872d78d7878","abstract_canon_sha256":"2b50dd6cb161e9bac2025da1f353deff5067d379eda594e91c5c14d88d1f9ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:09.756006Z","signature_b64":"oY7nF2ljyQiG+Z3azP7ks2hUNnygR6edKWEBYuS2PpzAwNV6i7BxG5re+QIwDGICPjav0Ujx5X/76Ym1b/8yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5d97f26e8060082bc67a4f1fc7d81d61aacf837e337e1604b502d296699f7ae","last_reissued_at":"2026-05-17T23:45:09.755419Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:09.755419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Incremental Nonconvex Optimization Approach for Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongkai Zhao, Jian-Feng Cai, Ji Li","submitted_at":"2018-07-15T06:57:06Z","abstract_excerpt":"We aim to find a solution $\\bm{x}\\in\\mathbb{C}^n$ to a system of quadratic equations of the form $b_i=\\lvert\\bm{a}_i^*\\bm{x}\\rvert^2$, $i=1,2,\\ldots,m$, e.g., the well-known NP-hard phase retrieval problem. As opposed to recently proposed state-of-the-art nonconvex methods, we revert to the semidefinite relaxation (SDR) PhaseLift convex formulation and propose a successive and incremental nonconvex optimization algorithm, termed as \\texttt{IncrePR}, to indirectly minimize the resulting convex problem on the cone of positive semidefinite matrices. Our proposed method overcomes the excessive com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05499","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":"1807.05499","created_at":"2026-05-17T23:45:09.755504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05499v3","created_at":"2026-05-17T23:45:09.755504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05499","created_at":"2026-05-17T23:45:09.755504+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XMX6JXIAYAI","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XMX6JXIAYAIFPDH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XMX6JXI","created_at":"2026-05-18T12:32:02.567920+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/2XMX6JXIAYAIFPDHUTY7Y7MB2Y","json":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y.json","graph_json":"https://pith.science/api/pith-number/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/graph.json","events_json":"https://pith.science/api/pith-number/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/events.json","paper":"https://pith.science/paper/2XMX6JXI"},"agent_actions":{"view_html":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y","download_json":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y.json","view_paper":"https://pith.science/paper/2XMX6JXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05499&json=true","fetch_graph":"https://pith.science/api/pith-number/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/action/storage_attestation","attest_author":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/action/author_attestation","sign_citation":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/action/citation_signature","submit_replication":"https://pith.science/pith/2XMX6JXIAYAIFPDHUTY7Y7MB2Y/action/replication_record"}},"created_at":"2026-05-17T23:45:09.755504+00:00","updated_at":"2026-05-17T23:45:09.755504+00:00"}