{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QNSK5YYX7DCCREKY2U7LTA5TQ3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aebdb050da1b8e28401eda8ee30cb32f15066c2a95f4de1e477374053bdf028a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T20:53:00Z","title_canon_sha256":"294c07b1b9199eba5c6e6ab00e8387510d46ffdb7d02d55bf78b72b0103ce344"},"schema_version":"1.0","source":{"id":"1410.2277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2277","created_at":"2026-05-18T01:41:49Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2277v1","created_at":"2026-05-18T01:41:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2277","created_at":"2026-05-18T01:41:49Z"},{"alias_kind":"pith_short_12","alias_value":"QNSK5YYX7DCC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNSK5YYX7DCCREKY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNSK5YYX","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d1236538ba59ce067d8f10cde1434a7e0dcb23b97c45bd5818480cb8c4cd6cfb","target":"graph","created_at":"2026-05-18T01:41:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Quadratically constrained quadratic programs (QCQPs) have a wide range of applications in signal processing and wireless communications. Non-convex QCQPs are NP-hard in general. Existing approaches relax the non-convexity using semi-definite relaxation (SDR) or linearize the non-convex part and solve the resulting convex problem. However, these techniques are seldom successful in even obtaining a feasible solution when the QCQP matrices are indefinite. In this paper, a new feasible point pursuit successive convex approximation (FPP-SCA) algorithm is proposed for non-convex QCQPs. FPP-SCA linea","authors_text":"Aritra Konar, Balasubramanian Gopalakrishnan, Kejun Huang, Nicholas D. Sidiropoulos, Omar Mehanna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T20:53:00Z","title":"Feasible Point Pursuit and Successive Approximation of Non-convex QCQPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2277","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b12b779a1fc9d01f9de586e8b81a95a70963073b988843e88c60140aaf64f49b","target":"record","created_at":"2026-05-18T01:41:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aebdb050da1b8e28401eda8ee30cb32f15066c2a95f4de1e477374053bdf028a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T20:53:00Z","title_canon_sha256":"294c07b1b9199eba5c6e6ab00e8387510d46ffdb7d02d55bf78b72b0103ce344"},"schema_version":"1.0","source":{"id":"1410.2277","kind":"arxiv","version":1}},"canonical_sha256":"8364aee317f8c4289158d53eb983b386ef2bd5dd37140e8727a52b960397025e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8364aee317f8c4289158d53eb983b386ef2bd5dd37140e8727a52b960397025e","first_computed_at":"2026-05-18T01:41:49.829723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:49.829723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ORVsPh7M53aTYkySNgc8x8okLXs0UsemmA48zQIuBh3DUqLGAjxy5ct4U8GzZsoJKPK8kw+JhcS2sI35jWh7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:49.830141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b12b779a1fc9d01f9de586e8b81a95a70963073b988843e88c60140aaf64f49b","sha256:d1236538ba59ce067d8f10cde1434a7e0dcb23b97c45bd5818480cb8c4cd6cfb"],"state_sha256":"45925e683546695c2855e1bbbd07b28220ce6c9d8e299562f36c8780e870b6f8"}