{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2UANZSSZNVEL2YQ3VXEZ5DFXEI","short_pith_number":"pith:2UANZSSZ","schema_version":"1.0","canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","source":{"kind":"arxiv","id":"1502.03777","version":2},"attestation_state":"computed","paper":{"title":"An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the AC Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Jean-Hubert Hours","submitted_at":"2015-02-12T19:20:47Z","abstract_excerpt":"A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ingredient is an alternating projected gradient sweep in place of the Cauchy point computation. It is proven that the algorithm yields a sequence that globally converges to a critical point. As a result of some changes to the standard trust region method, namely a proximal regularisation of the trust region subproblem, it is shown that the local convergence rate is linear with an arbitrarily small ratio. Thus, convergen"},"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":"1502.03777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T19:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"45fae39dc0fedf32a60e75ad4add3e58a978d04f39c4fae625999655a0a2b663","abstract_canon_sha256":"4de935f0de2b9f5ace9a88dcfa16aed6c7f8c0e8f2c8b35a5fc1b08a41f76f2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:01.559436Z","signature_b64":"uIb41wrbVBn+rtqAEM50xY1tNxNbHOhXSTPyYxNBBI8J0/2dCMuwtZqsIuGkQNstoNY5A64rcHrK0rgATslxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d500dcca596d48bd621badc99e8cb72238eca963d6ff4b696067ea5eda6083fb","last_reissued_at":"2026-05-18T01:36:01.558967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:01.558967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the AC Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Jean-Hubert Hours","submitted_at":"2015-02-12T19:20:47Z","abstract_excerpt":"A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ingredient is an alternating projected gradient sweep in place of the Cauchy point computation. It is proven that the algorithm yields a sequence that globally converges to a critical point. As a result of some changes to the standard trust region method, namely a proximal regularisation of the trust region subproblem, it is shown that the local convergence rate is linear with an arbitrarily small ratio. Thus, convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03777","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":"1502.03777","created_at":"2026-05-18T01:36:01.559052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03777v2","created_at":"2026-05-18T01:36:01.559052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03777","created_at":"2026-05-18T01:36:01.559052+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UANZSSZNVEL","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UANZSSZNVEL2YQ3","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UANZSSZ","created_at":"2026-05-18T12:29:02.477457+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/2UANZSSZNVEL2YQ3VXEZ5DFXEI","json":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI.json","graph_json":"https://pith.science/api/pith-number/2UANZSSZNVEL2YQ3VXEZ5DFXEI/graph.json","events_json":"https://pith.science/api/pith-number/2UANZSSZNVEL2YQ3VXEZ5DFXEI/events.json","paper":"https://pith.science/paper/2UANZSSZ"},"agent_actions":{"view_html":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI","download_json":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI.json","view_paper":"https://pith.science/paper/2UANZSSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03777&json=true","fetch_graph":"https://pith.science/api/pith-number/2UANZSSZNVEL2YQ3VXEZ5DFXEI/graph.json","fetch_events":"https://pith.science/api/pith-number/2UANZSSZNVEL2YQ3VXEZ5DFXEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/action/storage_attestation","attest_author":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/action/author_attestation","sign_citation":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/action/citation_signature","submit_replication":"https://pith.science/pith/2UANZSSZNVEL2YQ3VXEZ5DFXEI/action/replication_record"}},"created_at":"2026-05-18T01:36:01.559052+00:00","updated_at":"2026-05-18T01:36:01.559052+00:00"}