{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3CETY4Z3IERJ7KM4IICLKQTKMQ","short_pith_number":"pith:3CETY4Z3","schema_version":"1.0","canonical_sha256":"d8893c733b41229fa99c4204b5426a64314eaa0a92a6b8a99a132624754388a4","source":{"kind":"arxiv","id":"2302.07947","version":2},"attestation_state":"computed","paper":{"title":"A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Songqiang Qiu, Vyacheslav Kungurtsev","submitted_at":"2023-02-15T21:00:01Z","abstract_excerpt":"In this paper, a robust sequential quadratic programming method for constrained optimization is generalized to problem with an {expectation} objective function {and} deterministic equality and inequality constraints. A stochastic line search scheme is employed to globalize the steps. {We show theoretically that sequences generated by the algorithm converge almost surely to a Karush-Kuhn-Tucker point under the assumption of the extended Mangasarian-Fromovitz constraint qualification}. Encouraging numerical results are reported."},"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":"2302.07947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-15T21:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"62926f12f52627ddefa2654ae3cb9c67ca7e88b8a7e958151e6fcdc639d4fffc","abstract_canon_sha256":"a28599c55ac4a94abba11f156aa70db545a3d9e1e1ba0512ad14052a0ca7d016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:25.966411Z","signature_b64":"jC9OSBKYSIB5lYuN88vNagQcPn7UbCmE5gisxl6mSvu9mX8/y5abIN7j3RJolVTm97uWflSF6yGAaySCtqB7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8893c733b41229fa99c4204b5426a64314eaa0a92a6b8a99a132624754388a4","last_reissued_at":"2026-07-05T09:15:25.965970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:25.965970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Songqiang Qiu, Vyacheslav Kungurtsev","submitted_at":"2023-02-15T21:00:01Z","abstract_excerpt":"In this paper, a robust sequential quadratic programming method for constrained optimization is generalized to problem with an {expectation} objective function {and} deterministic equality and inequality constraints. A stochastic line search scheme is employed to globalize the steps. {We show theoretically that sequences generated by the algorithm converge almost surely to a Karush-Kuhn-Tucker point under the assumption of the extended Mangasarian-Fromovitz constraint qualification}. Encouraging numerical results are reported."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07947","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.07947/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":"2302.07947","created_at":"2026-07-05T09:15:25.966038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07947v2","created_at":"2026-07-05T09:15:25.966038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07947","created_at":"2026-07-05T09:15:25.966038+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CETY4Z3IERJ","created_at":"2026-07-05T09:15:25.966038+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CETY4Z3IERJ7KM4","created_at":"2026-07-05T09:15:25.966038+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CETY4Z3","created_at":"2026-07-05T09:15:25.966038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19382","citing_title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ","json":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ.json","graph_json":"https://pith.science/api/pith-number/3CETY4Z3IERJ7KM4IICLKQTKMQ/graph.json","events_json":"https://pith.science/api/pith-number/3CETY4Z3IERJ7KM4IICLKQTKMQ/events.json","paper":"https://pith.science/paper/3CETY4Z3"},"agent_actions":{"view_html":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ","download_json":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ.json","view_paper":"https://pith.science/paper/3CETY4Z3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07947&json=true","fetch_graph":"https://pith.science/api/pith-number/3CETY4Z3IERJ7KM4IICLKQTKMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3CETY4Z3IERJ7KM4IICLKQTKMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ/action/storage_attestation","attest_author":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ/action/author_attestation","sign_citation":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ/action/citation_signature","submit_replication":"https://pith.science/pith/3CETY4Z3IERJ7KM4IICLKQTKMQ/action/replication_record"}},"created_at":"2026-07-05T09:15:25.966038+00:00","updated_at":"2026-07-05T09:15:25.966038+00:00"}