{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QCPI6ANIK2GS5GIHKO2SP64J6V","short_pith_number":"pith:QCPI6ANI","schema_version":"1.0","canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","source":{"kind":"arxiv","id":"1711.04401","version":1},"attestation_state":"computed","paper":{"title":"Quadratic Programming Over Ellipsoids (with Applications to Constrained Linear Regression and Tensor Decomposition)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Danilo Mandic, Masao Yamagishi","submitted_at":"2017-11-13T03:03:51Z","abstract_excerpt":"A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an augmented-Lagrangian algorithm is developed for this multiple constraint optimisation. Benefit from the fact that the QP over a single sphere can be solved in a closed form by solving a secular equation, we derive a tighter bound of the minimiser of the secular equation. We also propose to generate a new psd matrix with a low condition number from the matric"},"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":"1711.04401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-13T03:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"02d4743043e3d5caed45aa0c8d7f42e510b748d5b2f353c74f4031cbdbabdf99","abstract_canon_sha256":"77eb4de6678d3849b9fa9ddf33a3eb5d442af07c1240981be5955c267994881c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:39.149584Z","signature_b64":"azWoKsghl1x2fVWlBQWAt+SrfTsI7Zapiw+XEanZhkZe0kcju35lu4lapdT9T0qAbkqBmrP0ZZP+OvNW3lKhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","last_reissued_at":"2026-05-18T00:30:39.148880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:39.148880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic Programming Over Ellipsoids (with Applications to Constrained Linear Regression and Tensor Decomposition)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Danilo Mandic, Masao Yamagishi","submitted_at":"2017-11-13T03:03:51Z","abstract_excerpt":"A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an augmented-Lagrangian algorithm is developed for this multiple constraint optimisation. Benefit from the fact that the QP over a single sphere can be solved in a closed form by solving a secular equation, we derive a tighter bound of the minimiser of the secular equation. We also propose to generate a new psd matrix with a low condition number from the matric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04401","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":"1711.04401","created_at":"2026-05-18T00:30:39.148988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04401v1","created_at":"2026-05-18T00:30:39.148988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04401","created_at":"2026-05-18T00:30:39.148988+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCPI6ANIK2GS","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCPI6ANIK2GS5GIH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCPI6ANI","created_at":"2026-05-18T12:31:37.085036+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/QCPI6ANIK2GS5GIHKO2SP64J6V","json":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V.json","graph_json":"https://pith.science/api/pith-number/QCPI6ANIK2GS5GIHKO2SP64J6V/graph.json","events_json":"https://pith.science/api/pith-number/QCPI6ANIK2GS5GIHKO2SP64J6V/events.json","paper":"https://pith.science/paper/QCPI6ANI"},"agent_actions":{"view_html":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V","download_json":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V.json","view_paper":"https://pith.science/paper/QCPI6ANI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04401&json=true","fetch_graph":"https://pith.science/api/pith-number/QCPI6ANIK2GS5GIHKO2SP64J6V/graph.json","fetch_events":"https://pith.science/api/pith-number/QCPI6ANIK2GS5GIHKO2SP64J6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/action/storage_attestation","attest_author":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/action/author_attestation","sign_citation":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/action/citation_signature","submit_replication":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/action/replication_record"}},"created_at":"2026-05-18T00:30:39.148988+00:00","updated_at":"2026-05-18T00:30:39.148988+00:00"}