{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IS5OW2CERQ6FRTLDX7NKL5GRII","short_pith_number":"pith:IS5OW2CE","schema_version":"1.0","canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","source":{"kind":"arxiv","id":"1402.4198","version":1},"attestation_state":"computed","paper":{"title":"An SDP Approach For Solving Quadratic Fractional Programming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ruey-Lin Sheu, Van-Bong Nguyen, Yong Xia","submitted_at":"2014-02-18T01:07:23Z","abstract_excerpt":"This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family of quadratic functions, which makes (P) highly related to, but more difficult than a single quadratic programming problem subject to a similar constraint set. The task is to find the optimal parameter $\\lambda^*$ and then look for the optimal solution if $\\lambda^*$ is attained. Contrasted with the classical Dinkelbach method that iterates over the paramete"},"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":"1402.4198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T01:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"d10e2a865ad85d2721faf4a497366b626253f7c74b273f24a4ed8dd1659f1e07","abstract_canon_sha256":"0c6a0dac4315f41f183f071440b91fdb27363cb9aa22ad70e9e2815fd08adf81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.556527Z","signature_b64":"81x+Ia8P4FLMoHrotg7NqWN/TyZ1uh+Y01/ZlnjF9w5mMueN4pd6V8f4kFz6xMz1mvCU+8TpwblBtLppfbRbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","last_reissued_at":"2026-05-18T02:58:44.555763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.555763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An SDP Approach For Solving Quadratic Fractional Programming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ruey-Lin Sheu, Van-Bong Nguyen, Yong Xia","submitted_at":"2014-02-18T01:07:23Z","abstract_excerpt":"This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family of quadratic functions, which makes (P) highly related to, but more difficult than a single quadratic programming problem subject to a similar constraint set. The task is to find the optimal parameter $\\lambda^*$ and then look for the optimal solution if $\\lambda^*$ is attained. Contrasted with the classical Dinkelbach method that iterates over the paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4198","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":"1402.4198","created_at":"2026-05-18T02:58:44.555876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4198v1","created_at":"2026-05-18T02:58:44.555876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4198","created_at":"2026-05-18T02:58:44.555876+00:00"},{"alias_kind":"pith_short_12","alias_value":"IS5OW2CERQ6F","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IS5OW2CERQ6FRTLD","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IS5OW2CE","created_at":"2026-05-18T12:28:33.132498+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/IS5OW2CERQ6FRTLDX7NKL5GRII","json":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII.json","graph_json":"https://pith.science/api/pith-number/IS5OW2CERQ6FRTLDX7NKL5GRII/graph.json","events_json":"https://pith.science/api/pith-number/IS5OW2CERQ6FRTLDX7NKL5GRII/events.json","paper":"https://pith.science/paper/IS5OW2CE"},"agent_actions":{"view_html":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII","download_json":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII.json","view_paper":"https://pith.science/paper/IS5OW2CE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4198&json=true","fetch_graph":"https://pith.science/api/pith-number/IS5OW2CERQ6FRTLDX7NKL5GRII/graph.json","fetch_events":"https://pith.science/api/pith-number/IS5OW2CERQ6FRTLDX7NKL5GRII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/action/storage_attestation","attest_author":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/action/author_attestation","sign_citation":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/action/citation_signature","submit_replication":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/action/replication_record"}},"created_at":"2026-05-18T02:58:44.555876+00:00","updated_at":"2026-05-18T02:58:44.555876+00:00"}