{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GDAK47GOW5CVYAHPVUNIEL2S7P","short_pith_number":"pith:GDAK47GO","schema_version":"1.0","canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","source":{"kind":"arxiv","id":"1309.3000","version":1},"attestation_state":"computed","paper":{"title":"Trust--Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, V. Jeyakumar","submitted_at":"2013-09-11T23:20:36Z","abstract_excerpt":"The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact semi-definite linear programming relaxation (SDP relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region problem having extra linear constraints. This paper shows that two useful and powerful features of the classical trust-region problem continue to hold for an extended trust-region problem with linear inequ"},"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":"1309.3000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-11T23:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"7c0876ce400d9a4da03a03e63efaaec45a57deeb68e8ac5412afbc8fcca8405b","abstract_canon_sha256":"c42d6218fdfa872cea9b373b87e08c13a1e7e7a2da2a41d5466f07f6547dab75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:33.139556Z","signature_b64":"PED9pSZ62JM47KiLDxZWZ30NPjwL7C9SWoZzsNIKXDUNpOgbSAjrxPzdGm0vcSPyVe/TFf0rrReRbc4MPHanBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c0ae7cceb7455c00efad1a822f52fbd5d9387574f592546e237823917b609a","last_reissued_at":"2026-05-18T03:13:33.138552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:33.138552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trust--Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, V. Jeyakumar","submitted_at":"2013-09-11T23:20:36Z","abstract_excerpt":"The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact semi-definite linear programming relaxation (SDP relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region problem having extra linear constraints. This paper shows that two useful and powerful features of the classical trust-region problem continue to hold for an extended trust-region problem with linear inequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3000","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":"1309.3000","created_at":"2026-05-18T03:13:33.138705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3000v1","created_at":"2026-05-18T03:13:33.138705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3000","created_at":"2026-05-18T03:13:33.138705+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDAK47GOW5CV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDAK47GOW5CVYAHP","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDAK47GO","created_at":"2026-05-18T12:27:45.050594+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/GDAK47GOW5CVYAHPVUNIEL2S7P","json":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P.json","graph_json":"https://pith.science/api/pith-number/GDAK47GOW5CVYAHPVUNIEL2S7P/graph.json","events_json":"https://pith.science/api/pith-number/GDAK47GOW5CVYAHPVUNIEL2S7P/events.json","paper":"https://pith.science/paper/GDAK47GO"},"agent_actions":{"view_html":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P","download_json":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P.json","view_paper":"https://pith.science/paper/GDAK47GO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3000&json=true","fetch_graph":"https://pith.science/api/pith-number/GDAK47GOW5CVYAHPVUNIEL2S7P/graph.json","fetch_events":"https://pith.science/api/pith-number/GDAK47GOW5CVYAHPVUNIEL2S7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/action/storage_attestation","attest_author":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/action/author_attestation","sign_citation":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/action/citation_signature","submit_replication":"https://pith.science/pith/GDAK47GOW5CVYAHPVUNIEL2S7P/action/replication_record"}},"created_at":"2026-05-18T03:13:33.138705+00:00","updated_at":"2026-05-18T03:13:33.138705+00:00"}