{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2FPYWB57AMAMILCPFMMXYZ675W","short_pith_number":"pith:2FPYWB57","schema_version":"1.0","canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","source":{"kind":"arxiv","id":"2006.06934","version":3},"attestation_state":"computed","paper":{"title":"Gradient Projection for Solving Quadratic Programs with Standard Simplex Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Youwei Liang","submitted_at":"2020-06-12T03:55:01Z","abstract_excerpt":"An important method to optimize a function on standard simplex is the active set algorithm, which requires the gradient of the function to be projected onto a hyperplane, with sign constraints on the variables that lie in the boundary of the simplex. We propose a new algorithm to efficiently project the gradient for this purpose. Furthermore, we apply the proposed gradient projection method to quadratic programs (QP) with standard simplex constraints, where gradient projection is used to explore the feasible region and, when we believe the optimal active set is identified, we switch to constra"},"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":"2006.06934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-12T03:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"c545fbb4556d4bc3e19a99aae296a1250d3de519b729038c95551495042b5abb","abstract_canon_sha256":"bd72fbcf9023e588d49adc60b868b09f5d4fe95a9bb816355da7e1e92a0ff39f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:53.180966Z","signature_b64":"XQK+1uo5K67WW0V25wvgO9tYjAQwhPEfq67g/HBjx0b/8KymNdcnE/QuZySG1pUKuVtuUmo4HJvft5QC7C7UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","last_reissued_at":"2026-07-05T01:19:53.180495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:53.180495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Projection for Solving Quadratic Programs with Standard Simplex Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Youwei Liang","submitted_at":"2020-06-12T03:55:01Z","abstract_excerpt":"An important method to optimize a function on standard simplex is the active set algorithm, which requires the gradient of the function to be projected onto a hyperplane, with sign constraints on the variables that lie in the boundary of the simplex. We propose a new algorithm to efficiently project the gradient for this purpose. Furthermore, we apply the proposed gradient projection method to quadratic programs (QP) with standard simplex constraints, where gradient projection is used to explore the feasible region and, when we believe the optimal active set is identified, we switch to constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06934","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.06934/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.06934","created_at":"2026-07-05T01:19:53.180558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.06934v3","created_at":"2026-07-05T01:19:53.180558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06934","created_at":"2026-07-05T01:19:53.180558+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FPYWB57AMAM","created_at":"2026-07-05T01:19:53.180558+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FPYWB57AMAMILCP","created_at":"2026-07-05T01:19:53.180558+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FPYWB57","created_at":"2026-07-05T01:19:53.180558+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/2FPYWB57AMAMILCPFMMXYZ675W","json":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W.json","graph_json":"https://pith.science/api/pith-number/2FPYWB57AMAMILCPFMMXYZ675W/graph.json","events_json":"https://pith.science/api/pith-number/2FPYWB57AMAMILCPFMMXYZ675W/events.json","paper":"https://pith.science/paper/2FPYWB57"},"agent_actions":{"view_html":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W","download_json":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W.json","view_paper":"https://pith.science/paper/2FPYWB57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.06934&json=true","fetch_graph":"https://pith.science/api/pith-number/2FPYWB57AMAMILCPFMMXYZ675W/graph.json","fetch_events":"https://pith.science/api/pith-number/2FPYWB57AMAMILCPFMMXYZ675W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/action/storage_attestation","attest_author":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/action/author_attestation","sign_citation":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/action/citation_signature","submit_replication":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/action/replication_record"}},"created_at":"2026-07-05T01:19:53.180558+00:00","updated_at":"2026-07-05T01:19:53.180558+00:00"}