{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QSC2BZQUSOXBLWRGDT2C55LN42","short_pith_number":"pith:QSC2BZQU","schema_version":"1.0","canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","source":{"kind":"arxiv","id":"1807.07563","version":2},"attestation_state":"computed","paper":{"title":"A linear-time algorithm for generalized trust region subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Duan Li, Rujun Jiang","submitted_at":"2018-07-19T17:59:37Z","abstract_excerpt":"In this paper, we provide the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving the generalized trust region subproblem (GTRS) of minimizing a quadratic function over a quadratic constraint under some regular conditions. Our algorithm is motivated by and extends a recent linear-time algorithm for the trust region subproblem by Hazan and Koren [Math. Program., 2016, 158(1-2): 363-381]. However, due to the non-convexity and non-compactness of the feasible region, such an extension is nontrivial. Our main contribution is to demonstrate"},"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":"1807.07563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-19T17:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"3f3c1330f82adeb6b5068fe6a639b7f3d32a034d904fbaaf3ab2a740f55271dd","abstract_canon_sha256":"c6b58388cf51a68254f8c2221552b78b09664b4b49e81a704ba983f50897359e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.053352Z","signature_b64":"xiZrSu76U727noGO3xbJA04m06o44k7hnSH/rZUYSFTkRhkTsQ2xBehtbRat2hmQ2pD6FBRpXuvq6vhxxEy0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8485a0e61493ae15da261cf42ef56de6b546b4563a5ac0ba2c1aba9b509881b0","last_reissued_at":"2026-05-17T23:47:03.052641Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.052641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A linear-time algorithm for generalized trust region subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Duan Li, Rujun Jiang","submitted_at":"2018-07-19T17:59:37Z","abstract_excerpt":"In this paper, we provide the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving the generalized trust region subproblem (GTRS) of minimizing a quadratic function over a quadratic constraint under some regular conditions. Our algorithm is motivated by and extends a recent linear-time algorithm for the trust region subproblem by Hazan and Koren [Math. Program., 2016, 158(1-2): 363-381]. However, due to the non-convexity and non-compactness of the feasible region, such an extension is nontrivial. Our main contribution is to demonstrate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07563","kind":"arxiv","version":2},"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":"1807.07563","created_at":"2026-05-17T23:47:03.052739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07563v2","created_at":"2026-05-17T23:47:03.052739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07563","created_at":"2026-05-17T23:47:03.052739+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSC2BZQUSOXB","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSC2BZQUSOXBLWRG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSC2BZQU","created_at":"2026-05-18T12:32:46.962924+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/QSC2BZQUSOXBLWRGDT2C55LN42","json":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42.json","graph_json":"https://pith.science/api/pith-number/QSC2BZQUSOXBLWRGDT2C55LN42/graph.json","events_json":"https://pith.science/api/pith-number/QSC2BZQUSOXBLWRGDT2C55LN42/events.json","paper":"https://pith.science/paper/QSC2BZQU"},"agent_actions":{"view_html":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42","download_json":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42.json","view_paper":"https://pith.science/paper/QSC2BZQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07563&json=true","fetch_graph":"https://pith.science/api/pith-number/QSC2BZQUSOXBLWRGDT2C55LN42/graph.json","fetch_events":"https://pith.science/api/pith-number/QSC2BZQUSOXBLWRGDT2C55LN42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/action/storage_attestation","attest_author":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/action/author_attestation","sign_citation":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/action/citation_signature","submit_replication":"https://pith.science/pith/QSC2BZQUSOXBLWRGDT2C55LN42/action/replication_record"}},"created_at":"2026-05-17T23:47:03.052739+00:00","updated_at":"2026-05-17T23:47:03.052739+00:00"}