{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z7HWPXCGQ72JAIVY6K7KS3ORYF","short_pith_number":"pith:Z7HWPXCG","schema_version":"1.0","canonical_sha256":"cfcf67dc4687f49022b8f2bea96dd1c149c5d44c7ef673f52bc66837c6a51e16","source":{"kind":"arxiv","id":"1707.00337","version":1},"attestation_state":"computed","paper":{"title":"Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Daniel P. Robinson, Frank E. Curtis, Mohammadreza Samadi","submitted_at":"2017-07-02T19:25:38Z","abstract_excerpt":"A method is proposed for solving equality constrained nonlinear optimization problems involving twice continuously differentiable functions. The method employs a trust funnel approach consisting of two phases: a first phase to locate an $\\epsilon$-feasible point and a second phase to seek optimality while maintaining at least $\\epsilon$-feasibility. A two-phase approach of this kind based on a cubic regularization methodology was recently proposed along with a supporting worst-case iteration complexity analysis. Unfortunately, however, in that approach, the objective function is completely ign"},"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":"1707.00337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-02T19:25:38Z","cross_cats_sorted":["cs.CC","cs.NA","math.OC"],"title_canon_sha256":"14d761b17c964a6cd07dc61c367d64aa23b3d4d66fd501228d55b107aa26578b","abstract_canon_sha256":"3b836f3b90839471b048c2591cbbb46eace600ec341b96818510c3744d376789"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:03.686154Z","signature_b64":"ozvHZtyEBVDkI0/oeiIu/3n6887dXsyb4/eftC/nHGFyCmqG6W5YHY0n66US4GqtMpXNNirDwJXUSaXrWKF4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcf67dc4687f49022b8f2bea96dd1c149c5d44c7ef673f52bc66837c6a51e16","last_reissued_at":"2026-05-18T00:41:03.685415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:03.685415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Daniel P. Robinson, Frank E. Curtis, Mohammadreza Samadi","submitted_at":"2017-07-02T19:25:38Z","abstract_excerpt":"A method is proposed for solving equality constrained nonlinear optimization problems involving twice continuously differentiable functions. The method employs a trust funnel approach consisting of two phases: a first phase to locate an $\\epsilon$-feasible point and a second phase to seek optimality while maintaining at least $\\epsilon$-feasibility. A two-phase approach of this kind based on a cubic regularization methodology was recently proposed along with a supporting worst-case iteration complexity analysis. Unfortunately, however, in that approach, the objective function is completely ign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00337","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":"1707.00337","created_at":"2026-05-18T00:41:03.685513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00337v1","created_at":"2026-05-18T00:41:03.685513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00337","created_at":"2026-05-18T00:41:03.685513+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7HWPXCGQ72J","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7HWPXCGQ72JAIVY","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7HWPXCG","created_at":"2026-05-18T12:31:59.375834+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/Z7HWPXCGQ72JAIVY6K7KS3ORYF","json":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF.json","graph_json":"https://pith.science/api/pith-number/Z7HWPXCGQ72JAIVY6K7KS3ORYF/graph.json","events_json":"https://pith.science/api/pith-number/Z7HWPXCGQ72JAIVY6K7KS3ORYF/events.json","paper":"https://pith.science/paper/Z7HWPXCG"},"agent_actions":{"view_html":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF","download_json":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF.json","view_paper":"https://pith.science/paper/Z7HWPXCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00337&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7HWPXCGQ72JAIVY6K7KS3ORYF/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7HWPXCGQ72JAIVY6K7KS3ORYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF/action/storage_attestation","attest_author":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF/action/author_attestation","sign_citation":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF/action/citation_signature","submit_replication":"https://pith.science/pith/Z7HWPXCGQ72JAIVY6K7KS3ORYF/action/replication_record"}},"created_at":"2026-05-18T00:41:03.685513+00:00","updated_at":"2026-05-18T00:41:03.685513+00:00"}