{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4E5WBLNLLRCYJLKQ6ARYTZS2VE","short_pith_number":"pith:4E5WBLNL","schema_version":"1.0","canonical_sha256":"e13b60adab5c4584ad50f02389e65aa90a45bb33ca40e45a7f0091008a32268f","source":{"kind":"arxiv","id":"2101.02164","version":1},"attestation_state":"computed","paper":{"title":"A Julia implementation of Algorithm NCL for constrained optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ding Ma, Dominique Orban, Michael A. Saunders","submitted_at":"2021-01-06T17:57:44Z","abstract_excerpt":"Algorithm NCL is designed for general smooth optimization problems where first and second derivatives are available, including problems whose constraints may not be linearly independent at a solution (i.e., do not satisfy the LICQ). It is equivalent to the LANCELOT augmented Lagrangian method, reformulated as a short sequence of nonlinearly constrained subproblems that can be solved efficiently by IPOPT and KNITRO, with warm starts on each subproblem. We give numerical results from a Julia implementation of Algorithm NCL on tax policy models that do not satisfy the LICQ, and on nonlinear least"},"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":"2101.02164","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-06T17:57:44Z","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"title_canon_sha256":"fd36fa10e173054b328e1bf1e609f0ec1038aa3eae9e959929c8d93cbc2c4f40","abstract_canon_sha256":"0c2f4841bfd6beb9f372e866ad1663574fa6dfcc18cc4650fdc167941cca16ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:55.925212Z","signature_b64":"Le1EeoBKvfncnAe5qGH9u3i2hA8CzW9UECKkWKU9KaJqdP3rYpjkhutsWo/R+1CiDx/nBmiI1Di8k93tsdl4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13b60adab5c4584ad50f02389e65aa90a45bb33ca40e45a7f0091008a32268f","last_reissued_at":"2026-07-05T02:09:55.924821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:55.924821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Julia implementation of Algorithm NCL for constrained optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ding Ma, Dominique Orban, Michael A. Saunders","submitted_at":"2021-01-06T17:57:44Z","abstract_excerpt":"Algorithm NCL is designed for general smooth optimization problems where first and second derivatives are available, including problems whose constraints may not be linearly independent at a solution (i.e., do not satisfy the LICQ). It is equivalent to the LANCELOT augmented Lagrangian method, reformulated as a short sequence of nonlinearly constrained subproblems that can be solved efficiently by IPOPT and KNITRO, with warm starts on each subproblem. We give numerical results from a Julia implementation of Algorithm NCL on tax policy models that do not satisfy the LICQ, and on nonlinear least"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.02164","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.02164/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.02164","created_at":"2026-07-05T02:09:55.924883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.02164v1","created_at":"2026-07-05T02:09:55.924883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.02164","created_at":"2026-07-05T02:09:55.924883+00:00"},{"alias_kind":"pith_short_12","alias_value":"4E5WBLNLLRCY","created_at":"2026-07-05T02:09:55.924883+00:00"},{"alias_kind":"pith_short_16","alias_value":"4E5WBLNLLRCYJLKQ","created_at":"2026-07-05T02:09:55.924883+00:00"},{"alias_kind":"pith_short_8","alias_value":"4E5WBLNL","created_at":"2026-07-05T02:09:55.924883+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2110.02590","citing_title":"A Feasible Reduced Space Method for Real-Time Optimal Power Flow","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE","json":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE.json","graph_json":"https://pith.science/api/pith-number/4E5WBLNLLRCYJLKQ6ARYTZS2VE/graph.json","events_json":"https://pith.science/api/pith-number/4E5WBLNLLRCYJLKQ6ARYTZS2VE/events.json","paper":"https://pith.science/paper/4E5WBLNL"},"agent_actions":{"view_html":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE","download_json":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE.json","view_paper":"https://pith.science/paper/4E5WBLNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.02164&json=true","fetch_graph":"https://pith.science/api/pith-number/4E5WBLNLLRCYJLKQ6ARYTZS2VE/graph.json","fetch_events":"https://pith.science/api/pith-number/4E5WBLNLLRCYJLKQ6ARYTZS2VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE/action/storage_attestation","attest_author":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE/action/author_attestation","sign_citation":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE/action/citation_signature","submit_replication":"https://pith.science/pith/4E5WBLNLLRCYJLKQ6ARYTZS2VE/action/replication_record"}},"created_at":"2026-07-05T02:09:55.924883+00:00","updated_at":"2026-07-05T02:09:55.924883+00:00"}