{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UP5NKZWFOMKTGTQYK6FYW5MKA2","short_pith_number":"pith:UP5NKZWF","schema_version":"1.0","canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","source":{"kind":"arxiv","id":"1503.02753","version":1},"attestation_state":"computed","paper":{"title":"A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. G. Barrios, O. P. Ferreira, S. Z. N\\'emeth","submitted_at":"2015-03-10T02:17:57Z","abstract_excerpt":"In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an equivalence between the simplicial cone constrained convex quadratic programming problem and the one of finding the unique solution of a nonsmooth system of equations. It is shown that a semi-smooth Newton method applied to this nonsmooth system of equations is always well defined and under a mild assumption on the simplicial cone the method generates a sequence th"},"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":"1503.02753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T02:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"1e2c8d5098256a673cac80a074347636320de8dfeff64efb4ec408aa9f47eea2","abstract_canon_sha256":"49eb807645a3110edf3cdcc0e11d8e7209d814072008f1abbe158da152f5e2c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:13.198425Z","signature_b64":"mlfHHkh41uloJ7s3B6682EX0pk60cu0Ywg3VN3kBIT4angvtjygPkBhATxQnFceeaTnrURZq/Kqjtz82mnThAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","last_reissued_at":"2026-05-18T02:25:13.197971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:13.197971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. G. Barrios, O. P. Ferreira, S. Z. N\\'emeth","submitted_at":"2015-03-10T02:17:57Z","abstract_excerpt":"In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an equivalence between the simplicial cone constrained convex quadratic programming problem and the one of finding the unique solution of a nonsmooth system of equations. It is shown that a semi-smooth Newton method applied to this nonsmooth system of equations is always well defined and under a mild assumption on the simplicial cone the method generates a sequence th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02753","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":"1503.02753","created_at":"2026-05-18T02:25:13.198044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02753v1","created_at":"2026-05-18T02:25:13.198044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02753","created_at":"2026-05-18T02:25:13.198044+00:00"},{"alias_kind":"pith_short_12","alias_value":"UP5NKZWFOMKT","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UP5NKZWFOMKTGTQY","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UP5NKZWF","created_at":"2026-05-18T12:29:44.643036+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/UP5NKZWFOMKTGTQYK6FYW5MKA2","json":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2.json","graph_json":"https://pith.science/api/pith-number/UP5NKZWFOMKTGTQYK6FYW5MKA2/graph.json","events_json":"https://pith.science/api/pith-number/UP5NKZWFOMKTGTQYK6FYW5MKA2/events.json","paper":"https://pith.science/paper/UP5NKZWF"},"agent_actions":{"view_html":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2","download_json":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2.json","view_paper":"https://pith.science/paper/UP5NKZWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02753&json=true","fetch_graph":"https://pith.science/api/pith-number/UP5NKZWFOMKTGTQYK6FYW5MKA2/graph.json","fetch_events":"https://pith.science/api/pith-number/UP5NKZWFOMKTGTQYK6FYW5MKA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/action/storage_attestation","attest_author":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/action/author_attestation","sign_citation":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/action/citation_signature","submit_replication":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/action/replication_record"}},"created_at":"2026-05-18T02:25:13.198044+00:00","updated_at":"2026-05-18T02:25:13.198044+00:00"}