{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:67WDVYM6O3CHD2WNDF3KFVT5AR","short_pith_number":"pith:67WDVYM6","schema_version":"1.0","canonical_sha256":"f7ec3ae19e76c471eacd1976a2d67d045a29d0d4a3e2e5c7cea8c3a91d096f04","source":{"kind":"arxiv","id":"1408.5532","version":2},"attestation_state":"computed","paper":{"title":"On the resolution of misspecified convex optimization and monotone variational inequality problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hesam Ahmadi, Uday V. Shanbhag","submitted_at":"2014-08-23T21:38:50Z","abstract_excerpt":"We consider a misspecified optimization problem that requires minimizing a function f(x;q*) over a closed and convex set X where q* is an unknown vector of parameters that may be learnt by a parallel learning process. In this context, We examine the development of coupled schemes that generate iterates {x_k,q_k} as k goes to infinity, then {x_k} converges x*, a minimizer of f(x;q*) over X and {q_k} converges to q*. In the first part of the paper, we consider the solution of problems where f is either smooth or nonsmooth under various convexity assumptions on function f. In addition, rate state"},"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":"1408.5532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-23T21:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"6c99d4383b3c9933a671fd6aa3f3d7f017303adf1601550d326c309e96a86720","abstract_canon_sha256":"8d50fb83d2f31a30f2ad15bad0b2cb5138c67ad04c5b4e4d6e8e795f72df062a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:40.834436Z","signature_b64":"wIdaRLIkOPiH27Xwn5STjdLGIdjg5K7Lz4olgXvUic47qkq1vL5j6YZzoKuI0bsJb5h1/2r1oryOwapyFZoJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7ec3ae19e76c471eacd1976a2d67d045a29d0d4a3e2e5c7cea8c3a91d096f04","last_reissued_at":"2026-05-18T02:18:40.833655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:40.833655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the resolution of misspecified convex optimization and monotone variational inequality problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hesam Ahmadi, Uday V. Shanbhag","submitted_at":"2014-08-23T21:38:50Z","abstract_excerpt":"We consider a misspecified optimization problem that requires minimizing a function f(x;q*) over a closed and convex set X where q* is an unknown vector of parameters that may be learnt by a parallel learning process. In this context, We examine the development of coupled schemes that generate iterates {x_k,q_k} as k goes to infinity, then {x_k} converges x*, a minimizer of f(x;q*) over X and {q_k} converges to q*. In the first part of the paper, we consider the solution of problems where f is either smooth or nonsmooth under various convexity assumptions on function f. In addition, rate state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5532","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":"1408.5532","created_at":"2026-05-18T02:18:40.833782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5532v2","created_at":"2026-05-18T02:18:40.833782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5532","created_at":"2026-05-18T02:18:40.833782+00:00"},{"alias_kind":"pith_short_12","alias_value":"67WDVYM6O3CH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"67WDVYM6O3CHD2WN","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"67WDVYM6","created_at":"2026-05-18T12:28:16.859392+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/67WDVYM6O3CHD2WNDF3KFVT5AR","json":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR.json","graph_json":"https://pith.science/api/pith-number/67WDVYM6O3CHD2WNDF3KFVT5AR/graph.json","events_json":"https://pith.science/api/pith-number/67WDVYM6O3CHD2WNDF3KFVT5AR/events.json","paper":"https://pith.science/paper/67WDVYM6"},"agent_actions":{"view_html":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR","download_json":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR.json","view_paper":"https://pith.science/paper/67WDVYM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5532&json=true","fetch_graph":"https://pith.science/api/pith-number/67WDVYM6O3CHD2WNDF3KFVT5AR/graph.json","fetch_events":"https://pith.science/api/pith-number/67WDVYM6O3CHD2WNDF3KFVT5AR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR/action/storage_attestation","attest_author":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR/action/author_attestation","sign_citation":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR/action/citation_signature","submit_replication":"https://pith.science/pith/67WDVYM6O3CHD2WNDF3KFVT5AR/action/replication_record"}},"created_at":"2026-05-18T02:18:40.833782+00:00","updated_at":"2026-05-18T02:18:40.833782+00:00"}