{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PB6XO35EUARHDHMO2SLISZRERW","short_pith_number":"pith:PB6XO35E","schema_version":"1.0","canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","source":{"kind":"arxiv","id":"1710.11005","version":1},"attestation_state":"computed","paper":{"title":"A Derivative-Free Gauss-Newton Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Lindon Roberts","submitted_at":"2017-10-30T15:18:01Z","abstract_excerpt":"We present DFO-GN, a derivative-free version of the Gauss-Newton method for solving nonlinear least-squares problems. As is common in derivative-free optimization, DFO-GN uses interpolation of function values to build a model of the objective, which is then used within a trust-region framework to give a globally-convergent algorithm requiring $O(\\epsilon^{-2})$ iterations to reach approximate first-order criticality within tolerance $\\epsilon$. This algorithm is a simplification of the method from [H. Zhang, A. R. Conn, and K. Scheinberg, A Derivative-Free Algorithm for Least-Squares Minimizat"},"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":"1710.11005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-30T15:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"38a206b4caf873b13bca44b9d4f18bd2893d03fabfd5ee6991b171395d02d057","abstract_canon_sha256":"6499d7b5fef8c099488ca3914bd0c3e0cc9a59b22522b5561944e36a3ce5e083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.849837Z","signature_b64":"84/ASC2kR9c/hfEq2XZduOCEeI71aN1ABn7SM3+iR+uDjsN+Spl32l9HHXXXiknbivP60t34CGtSC5/dnNYHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787d776fa4a022719d8ed4968966248d9db1765c8748840c607b1cee0151fb26","last_reissued_at":"2026-05-18T00:31:45.849237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.849237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Derivative-Free Gauss-Newton Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Lindon Roberts","submitted_at":"2017-10-30T15:18:01Z","abstract_excerpt":"We present DFO-GN, a derivative-free version of the Gauss-Newton method for solving nonlinear least-squares problems. As is common in derivative-free optimization, DFO-GN uses interpolation of function values to build a model of the objective, which is then used within a trust-region framework to give a globally-convergent algorithm requiring $O(\\epsilon^{-2})$ iterations to reach approximate first-order criticality within tolerance $\\epsilon$. This algorithm is a simplification of the method from [H. Zhang, A. R. Conn, and K. Scheinberg, A Derivative-Free Algorithm for Least-Squares Minimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11005","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":"1710.11005","created_at":"2026-05-18T00:31:45.849329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11005v1","created_at":"2026-05-18T00:31:45.849329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11005","created_at":"2026-05-18T00:31:45.849329+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB6XO35EUARH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB6XO35EUARHDHMO","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB6XO35E","created_at":"2026-05-18T12:31:37.085036+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/PB6XO35EUARHDHMO2SLISZRERW","json":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW.json","graph_json":"https://pith.science/api/pith-number/PB6XO35EUARHDHMO2SLISZRERW/graph.json","events_json":"https://pith.science/api/pith-number/PB6XO35EUARHDHMO2SLISZRERW/events.json","paper":"https://pith.science/paper/PB6XO35E"},"agent_actions":{"view_html":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW","download_json":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW.json","view_paper":"https://pith.science/paper/PB6XO35E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11005&json=true","fetch_graph":"https://pith.science/api/pith-number/PB6XO35EUARHDHMO2SLISZRERW/graph.json","fetch_events":"https://pith.science/api/pith-number/PB6XO35EUARHDHMO2SLISZRERW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/action/storage_attestation","attest_author":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/action/author_attestation","sign_citation":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/action/citation_signature","submit_replication":"https://pith.science/pith/PB6XO35EUARHDHMO2SLISZRERW/action/replication_record"}},"created_at":"2026-05-18T00:31:45.849329+00:00","updated_at":"2026-05-18T00:31:45.849329+00:00"}