{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7B5R466LMTPISFIM3ATEQNSETQ","short_pith_number":"pith:7B5R466L","schema_version":"1.0","canonical_sha256":"f87b1e7bcb64de89150cd8264836449c21a4b4c3a1e01dbfd3f427ab339098ee","source":{"kind":"arxiv","id":"1510.08842","version":3},"attestation_state":"computed","paper":{"title":"MOCCA: mirrored convex/concave optimization for nonconvex composite functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emil Y. Sidky, Rina Foygel Barber","submitted_at":"2015-10-29T19:53:55Z","abstract_excerpt":"Many optimization problems arising in high-dimensional statistics decompose naturally into a sum of several terms, where the individual terms are relatively simple but the composite objective function can only be optimized with iterative algorithms. In this paper, we are interested in optimization problems of the form F(Kx) + G(x), where K is a fixed linear transformation, while F and G are functions that may be nonconvex and/or nondifferentiable. In particular, if either of the terms are nonconvex, existing alternating minimization techniques may fail to converge; other types of existing appr"},"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.08842","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T19:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"5c60181c4474947ab2ee565d3626c66db6971731f17ccfcbf067c407985d96d2","abstract_canon_sha256":"7c9063395fcbafdc97206ee105d40ab6fe8d5efcec7e5c4d0c9f802689c57a42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:43.739944Z","signature_b64":"WG656oMO9/L3ME8mp8rRobgOHIkGxlSOJq7jKb2UvoqqpkRFhu0rXay2qLscTBe+790fDorBF5Wv3/6oeo7SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f87b1e7bcb64de89150cd8264836449c21a4b4c3a1e01dbfd3f427ab339098ee","last_reissued_at":"2026-05-18T01:11:43.739568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:43.739568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MOCCA: mirrored convex/concave optimization for nonconvex composite functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emil Y. Sidky, Rina Foygel Barber","submitted_at":"2015-10-29T19:53:55Z","abstract_excerpt":"Many optimization problems arising in high-dimensional statistics decompose naturally into a sum of several terms, where the individual terms are relatively simple but the composite objective function can only be optimized with iterative algorithms. In this paper, we are interested in optimization problems of the form F(Kx) + G(x), where K is a fixed linear transformation, while F and G are functions that may be nonconvex and/or nondifferentiable. In particular, if either of the terms are nonconvex, existing alternating minimization techniques may fail to converge; other types of existing appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08842","kind":"arxiv","version":3},"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.08842","created_at":"2026-05-18T01:11:43.739632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08842v3","created_at":"2026-05-18T01:11:43.739632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08842","created_at":"2026-05-18T01:11:43.739632+00:00"},{"alias_kind":"pith_short_12","alias_value":"7B5R466LMTPI","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"7B5R466LMTPISFIM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"7B5R466L","created_at":"2026-05-18T12:29:07.941421+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/7B5R466LMTPISFIM3ATEQNSETQ","json":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ.json","graph_json":"https://pith.science/api/pith-number/7B5R466LMTPISFIM3ATEQNSETQ/graph.json","events_json":"https://pith.science/api/pith-number/7B5R466LMTPISFIM3ATEQNSETQ/events.json","paper":"https://pith.science/paper/7B5R466L"},"agent_actions":{"view_html":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ","download_json":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ.json","view_paper":"https://pith.science/paper/7B5R466L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08842&json=true","fetch_graph":"https://pith.science/api/pith-number/7B5R466LMTPISFIM3ATEQNSETQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7B5R466LMTPISFIM3ATEQNSETQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ/action/storage_attestation","attest_author":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ/action/author_attestation","sign_citation":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ/action/citation_signature","submit_replication":"https://pith.science/pith/7B5R466LMTPISFIM3ATEQNSETQ/action/replication_record"}},"created_at":"2026-05-18T01:11:43.739632+00:00","updated_at":"2026-05-18T01:11:43.739632+00:00"}