{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QNSK5YYX7DCCREKY2U7LTA5TQ3","short_pith_number":"pith:QNSK5YYX","schema_version":"1.0","canonical_sha256":"8364aee317f8c4289158d53eb983b386ef2bd5dd37140e8727a52b960397025e","source":{"kind":"arxiv","id":"1410.2277","version":1},"attestation_state":"computed","paper":{"title":"Feasible Point Pursuit and Successive Approximation of Non-convex QCQPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aritra Konar, Balasubramanian Gopalakrishnan, Kejun Huang, Nicholas D. Sidiropoulos, Omar Mehanna","submitted_at":"2014-10-08T20:53:00Z","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"},"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":"1410.2277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-08T20:53:00Z","cross_cats_sorted":[],"title_canon_sha256":"294c07b1b9199eba5c6e6ab00e8387510d46ffdb7d02d55bf78b72b0103ce344","abstract_canon_sha256":"aebdb050da1b8e28401eda8ee30cb32f15066c2a95f4de1e477374053bdf028a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:49.830141Z","signature_b64":"ORVsPh7M53aTYkySNgc8x8okLXs0UsemmA48zQIuBh3DUqLGAjxy5ct4U8GzZsoJKPK8kw+JhcS2sI35jWh7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8364aee317f8c4289158d53eb983b386ef2bd5dd37140e8727a52b960397025e","last_reissued_at":"2026-05-18T01:41:49.829723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:49.829723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feasible Point Pursuit and Successive Approximation of Non-convex QCQPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aritra Konar, Balasubramanian Gopalakrishnan, Kejun Huang, Nicholas D. Sidiropoulos, Omar Mehanna","submitted_at":"2014-10-08T20:53:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2277","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":"1410.2277","created_at":"2026-05-18T01:41:49.829794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2277v1","created_at":"2026-05-18T01:41:49.829794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2277","created_at":"2026-05-18T01:41:49.829794+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNSK5YYX7DCC","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNSK5YYX7DCCREKY","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNSK5YYX","created_at":"2026-05-18T12:28:46.137349+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/QNSK5YYX7DCCREKY2U7LTA5TQ3","json":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3.json","graph_json":"https://pith.science/api/pith-number/QNSK5YYX7DCCREKY2U7LTA5TQ3/graph.json","events_json":"https://pith.science/api/pith-number/QNSK5YYX7DCCREKY2U7LTA5TQ3/events.json","paper":"https://pith.science/paper/QNSK5YYX"},"agent_actions":{"view_html":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3","download_json":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3.json","view_paper":"https://pith.science/paper/QNSK5YYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2277&json=true","fetch_graph":"https://pith.science/api/pith-number/QNSK5YYX7DCCREKY2U7LTA5TQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/QNSK5YYX7DCCREKY2U7LTA5TQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3/action/storage_attestation","attest_author":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3/action/author_attestation","sign_citation":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3/action/citation_signature","submit_replication":"https://pith.science/pith/QNSK5YYX7DCCREKY2U7LTA5TQ3/action/replication_record"}},"created_at":"2026-05-18T01:41:49.829794+00:00","updated_at":"2026-05-18T01:41:49.829794+00:00"}