{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YKFFCHQ7ETO6RBNQO6EIMNZQGC","short_pith_number":"pith:YKFFCHQ7","schema_version":"1.0","canonical_sha256":"c28a511e1f24dde885b0778886373030af9a74b5e5ffb44bad4e387dae75d23e","source":{"kind":"arxiv","id":"1709.06985","version":1},"attestation_state":"computed","paper":{"title":"Error-tolerant Multisecant Method for Nonlinearly Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alp Dener, Jason E. Hicken, Pengfei Meng","submitted_at":"2017-09-20T17:51:31Z","abstract_excerpt":"We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order optimality conditions, and it is matrix-free in the sense that it does not require the explicit Lagrangian Hessian or Jacobian of the constraints. The solution method is quasi-Newton, but rather than approximating only the Hessian or constraint Jacobian, the Jacobian of the entire nonlinear set of equations is approximated using a multisecant method. We show ho"},"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":"1709.06985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-20T17:51:31Z","cross_cats_sorted":[],"title_canon_sha256":"c84a13a2db30e52caac54086e634dbd1131d54dbbb371de4e12a574ca5fa24ce","abstract_canon_sha256":"c67de9fc61a2c698b38fe47fa26928daa86bd962a617654945cb20136081e563"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:39.786903Z","signature_b64":"SFFv+8ryQ+CTPtcEFVzrxHtTlDAjImHac9xfsdcbMZWXcj0jwzAk+TaEmmRPcGEjhstmenNy2jBAvt/UfUbRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c28a511e1f24dde885b0778886373030af9a74b5e5ffb44bad4e387dae75d23e","last_reissued_at":"2026-05-18T00:34:39.786336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:39.786336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-tolerant Multisecant Method for Nonlinearly Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alp Dener, Jason E. Hicken, Pengfei Meng","submitted_at":"2017-09-20T17:51:31Z","abstract_excerpt":"We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order optimality conditions, and it is matrix-free in the sense that it does not require the explicit Lagrangian Hessian or Jacobian of the constraints. The solution method is quasi-Newton, but rather than approximating only the Hessian or constraint Jacobian, the Jacobian of the entire nonlinear set of equations is approximated using a multisecant method. We show ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06985","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":"1709.06985","created_at":"2026-05-18T00:34:39.786425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06985v1","created_at":"2026-05-18T00:34:39.786425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06985","created_at":"2026-05-18T00:34:39.786425+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKFFCHQ7ETO6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKFFCHQ7ETO6RBNQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKFFCHQ7","created_at":"2026-05-18T12:31:56.362134+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/YKFFCHQ7ETO6RBNQO6EIMNZQGC","json":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC.json","graph_json":"https://pith.science/api/pith-number/YKFFCHQ7ETO6RBNQO6EIMNZQGC/graph.json","events_json":"https://pith.science/api/pith-number/YKFFCHQ7ETO6RBNQO6EIMNZQGC/events.json","paper":"https://pith.science/paper/YKFFCHQ7"},"agent_actions":{"view_html":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC","download_json":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC.json","view_paper":"https://pith.science/paper/YKFFCHQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06985&json=true","fetch_graph":"https://pith.science/api/pith-number/YKFFCHQ7ETO6RBNQO6EIMNZQGC/graph.json","fetch_events":"https://pith.science/api/pith-number/YKFFCHQ7ETO6RBNQO6EIMNZQGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC/action/storage_attestation","attest_author":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC/action/author_attestation","sign_citation":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC/action/citation_signature","submit_replication":"https://pith.science/pith/YKFFCHQ7ETO6RBNQO6EIMNZQGC/action/replication_record"}},"created_at":"2026-05-18T00:34:39.786425+00:00","updated_at":"2026-05-18T00:34:39.786425+00:00"}