{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CWKWKGWUU5ZGPVY3OAT5FJDAAM","short_pith_number":"pith:CWKWKGWU","schema_version":"1.0","canonical_sha256":"1595651ad4a77267d71b7027d2a4600308868da8f3f244092cc4ae21dcf52dab","source":{"kind":"arxiv","id":"1510.00490","version":2},"attestation_state":"computed","paper":{"title":"On the rate analysis of inexact augmented Lagrangian schemes for convex optimization problems with misspecified constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"H. Ahmadi, N. S. Aybat, U. V. Shanbhag","submitted_at":"2015-10-02T04:47:18Z","abstract_excerpt":"We consider a misspecified optimization problem that requires minimizing of a convex function $f(x;\\theta^*)$ in x over a constraint set represented by $h(x;\\theta^*)\\leq 0$, where $\\theta^*$ is an unknown (or misspecified) vector of parameters. Suppose $\\theta^*$ can be learnt by a distinct process that generates a sequence of estimators $\\theta_k$, each of which is an increasingly accurate approximation of $\\theta^*$. We develop a first-order augmented Lagrangian scheme for computing an optimal solution $x^*$ while simultaneously learning $\\theta^*$."},"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":"1510.00490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-02T04:47:18Z","cross_cats_sorted":[],"title_canon_sha256":"749d332126f7a84a384ea976e09fa20f1fee587d9cdefa5e2f6446387aa64df9","abstract_canon_sha256":"33be491ba8ffd624ea1501554b4305282fd087ae22e076b91e87858115e2d020"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:43.347582Z","signature_b64":"p60zQ1KpppydYQg4pzrVQevh3U8tRQHzlROUNqRh5k/48aiC6WU2VIR4UyiupbJvZvhd3OQTW0nz4vBcOdyxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1595651ad4a77267d71b7027d2a4600308868da8f3f244092cc4ae21dcf52dab","last_reissued_at":"2026-05-18T01:08:43.347151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:43.347151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the rate analysis of inexact augmented Lagrangian schemes for convex optimization problems with misspecified constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"H. Ahmadi, N. S. Aybat, U. V. Shanbhag","submitted_at":"2015-10-02T04:47:18Z","abstract_excerpt":"We consider a misspecified optimization problem that requires minimizing of a convex function $f(x;\\theta^*)$ in x over a constraint set represented by $h(x;\\theta^*)\\leq 0$, where $\\theta^*$ is an unknown (or misspecified) vector of parameters. Suppose $\\theta^*$ can be learnt by a distinct process that generates a sequence of estimators $\\theta_k$, each of which is an increasingly accurate approximation of $\\theta^*$. We develop a first-order augmented Lagrangian scheme for computing an optimal solution $x^*$ while simultaneously learning $\\theta^*$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00490","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":""},"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":"1510.00490","created_at":"2026-05-18T01:08:43.347216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00490v2","created_at":"2026-05-18T01:08:43.347216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00490","created_at":"2026-05-18T01:08:43.347216+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWKWKGWUU5ZG","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWKWKGWUU5ZGPVY3","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWKWKGWU","created_at":"2026-05-18T12:29:17.054201+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/CWKWKGWUU5ZGPVY3OAT5FJDAAM","json":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM.json","graph_json":"https://pith.science/api/pith-number/CWKWKGWUU5ZGPVY3OAT5FJDAAM/graph.json","events_json":"https://pith.science/api/pith-number/CWKWKGWUU5ZGPVY3OAT5FJDAAM/events.json","paper":"https://pith.science/paper/CWKWKGWU"},"agent_actions":{"view_html":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM","download_json":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM.json","view_paper":"https://pith.science/paper/CWKWKGWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00490&json=true","fetch_graph":"https://pith.science/api/pith-number/CWKWKGWUU5ZGPVY3OAT5FJDAAM/graph.json","fetch_events":"https://pith.science/api/pith-number/CWKWKGWUU5ZGPVY3OAT5FJDAAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM/action/storage_attestation","attest_author":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM/action/author_attestation","sign_citation":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM/action/citation_signature","submit_replication":"https://pith.science/pith/CWKWKGWUU5ZGPVY3OAT5FJDAAM/action/replication_record"}},"created_at":"2026-05-18T01:08:43.347216+00:00","updated_at":"2026-05-18T01:08:43.347216+00:00"}