{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K2LRICMY6PSQW57HCGWU3M3H5U","short_pith_number":"pith:K2LRICMY","schema_version":"1.0","canonical_sha256":"5697140998f3e50b77e711ad4db367ed3a7d6a85813fe11685cf2e34b8cd7b11","source":{"kind":"arxiv","id":"1710.06465","version":1},"attestation_state":"computed","paper":{"title":"Convex optimization over intersection of simple sets: improved convergence rate guarantees via an exact penalty approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Achintya Kundu, Chiranjib Bhattacharyya, Francis Bach","submitted_at":"2017-10-17T18:40:13Z","abstract_excerpt":"We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty lies in finding the projection of a point in the intersection of many sets. Existing approaches yield an infeasible point with an iteration-complexity of $O(1/\\varepsilon^2)$ for nonsmooth problems with no guarantees on the in-feasibility. By reformulating the problem through exact penalty functions, we derive first-order algorithms which not only guarantee"},"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":"1710.06465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-17T18:40:13Z","cross_cats_sorted":[],"title_canon_sha256":"df7ccc58f780a13c29440025d938394f53c2213e632d24e331c1307d46ed4780","abstract_canon_sha256":"3a06e552293c2752e8f252b65a948d9fbe9b30a5cd667a297eb9903ed21aa9ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:33.617987Z","signature_b64":"aBCbBSKNrmmM3GQI/1chQv6zoBEwEIlc+atdIGhkkjAsfj2nEQmyJaknzN32TxUsfcGDsJE07t4TzsE6WMZ4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5697140998f3e50b77e711ad4db367ed3a7d6a85813fe11685cf2e34b8cd7b11","last_reissued_at":"2026-05-18T00:32:33.617244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:33.617244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex optimization over intersection of simple sets: improved convergence rate guarantees via an exact penalty approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Achintya Kundu, Chiranjib Bhattacharyya, Francis Bach","submitted_at":"2017-10-17T18:40:13Z","abstract_excerpt":"We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty lies in finding the projection of a point in the intersection of many sets. Existing approaches yield an infeasible point with an iteration-complexity of $O(1/\\varepsilon^2)$ for nonsmooth problems with no guarantees on the in-feasibility. By reformulating the problem through exact penalty functions, we derive first-order algorithms which not only guarantee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06465","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":"1710.06465","created_at":"2026-05-18T00:32:33.617394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06465v1","created_at":"2026-05-18T00:32:33.617394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06465","created_at":"2026-05-18T00:32:33.617394+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2LRICMY6PSQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2LRICMY6PSQW57H","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2LRICMY","created_at":"2026-05-18T12:31:24.725408+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/K2LRICMY6PSQW57HCGWU3M3H5U","json":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U.json","graph_json":"https://pith.science/api/pith-number/K2LRICMY6PSQW57HCGWU3M3H5U/graph.json","events_json":"https://pith.science/api/pith-number/K2LRICMY6PSQW57HCGWU3M3H5U/events.json","paper":"https://pith.science/paper/K2LRICMY"},"agent_actions":{"view_html":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U","download_json":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U.json","view_paper":"https://pith.science/paper/K2LRICMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06465&json=true","fetch_graph":"https://pith.science/api/pith-number/K2LRICMY6PSQW57HCGWU3M3H5U/graph.json","fetch_events":"https://pith.science/api/pith-number/K2LRICMY6PSQW57HCGWU3M3H5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U/action/storage_attestation","attest_author":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U/action/author_attestation","sign_citation":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U/action/citation_signature","submit_replication":"https://pith.science/pith/K2LRICMY6PSQW57HCGWU3M3H5U/action/replication_record"}},"created_at":"2026-05-18T00:32:33.617394+00:00","updated_at":"2026-05-18T00:32:33.617394+00:00"}