{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3XTXCFK6OBN3CHLJXGANXGW4WJ","short_pith_number":"pith:3XTXCFK6","schema_version":"1.0","canonical_sha256":"dde771155e705bb11d69b980db9adcb2666b9e76df20ab26e3f1f79f46b277a8","source":{"kind":"arxiv","id":"1410.4158","version":2},"attestation_state":"computed","paper":{"title":"Bounding Duality Gap for Separable Problems with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Madeleine Udell, Stephen Boyd","submitted_at":"2014-10-15T18:28:21Z","abstract_excerpt":"We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which each function in the objective is replaced by its convex envelope. We propose a randomized algorithm to solve the convexified problem which finds an $\\epsilon$-suboptimal solution to the original problem. With probability one, $\\epsilon$ is bounded by a term proportional to the maximal number of active constraints in the problem. The bound does not depend on "},"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":"1410.4158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-15T18:28:21Z","cross_cats_sorted":[],"title_canon_sha256":"0281c9d512ea97587d0b35a1c35666794974086b2ba8aae2addcb62d11037d69","abstract_canon_sha256":"76a6e26dd60795f4354c49f4102848c26b2678865e2cf6708d174c1f5357e97e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:08.789185Z","signature_b64":"0ToOZMt5tKhtXeJfQ8chcs28pjhUFAhKBJY6MZfzx37p3ybZTKzRjXlAiYzswlBdFNpr81BjbiZOH8EOJSJ8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde771155e705bb11d69b980db9adcb2666b9e76df20ab26e3f1f79f46b277a8","last_reissued_at":"2026-05-18T01:23:08.788609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:08.788609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Duality Gap for Separable Problems with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Madeleine Udell, Stephen Boyd","submitted_at":"2014-10-15T18:28:21Z","abstract_excerpt":"We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which each function in the objective is replaced by its convex envelope. We propose a randomized algorithm to solve the convexified problem which finds an $\\epsilon$-suboptimal solution to the original problem. With probability one, $\\epsilon$ is bounded by a term proportional to the maximal number of active constraints in the problem. The bound does not depend on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4158","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":"1410.4158","created_at":"2026-05-18T01:23:08.788694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4158v2","created_at":"2026-05-18T01:23:08.788694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4158","created_at":"2026-05-18T01:23:08.788694+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XTXCFK6OBN3","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XTXCFK6OBN3CHLJ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XTXCFK6","created_at":"2026-05-18T12:28:11.866339+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/3XTXCFK6OBN3CHLJXGANXGW4WJ","json":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ.json","graph_json":"https://pith.science/api/pith-number/3XTXCFK6OBN3CHLJXGANXGW4WJ/graph.json","events_json":"https://pith.science/api/pith-number/3XTXCFK6OBN3CHLJXGANXGW4WJ/events.json","paper":"https://pith.science/paper/3XTXCFK6"},"agent_actions":{"view_html":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ","download_json":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ.json","view_paper":"https://pith.science/paper/3XTXCFK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4158&json=true","fetch_graph":"https://pith.science/api/pith-number/3XTXCFK6OBN3CHLJXGANXGW4WJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3XTXCFK6OBN3CHLJXGANXGW4WJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ/action/storage_attestation","attest_author":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ/action/author_attestation","sign_citation":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ/action/citation_signature","submit_replication":"https://pith.science/pith/3XTXCFK6OBN3CHLJXGANXGW4WJ/action/replication_record"}},"created_at":"2026-05-18T01:23:08.788694+00:00","updated_at":"2026-05-18T01:23:08.788694+00:00"}