{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RIKZCM6ENJY7DSZYGPWDFETJLK","short_pith_number":"pith:RIKZCM6E","schema_version":"1.0","canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","source":{"kind":"arxiv","id":"1803.02487","version":2},"attestation_state":"computed","paper":{"title":"A Nonlinear Bregman Primal-Dual Framework for Optimizing Nonconvex Infimal Convolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Cremers, Emanuel Laude","submitted_at":"2018-03-07T00:28:07Z","abstract_excerpt":"This work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution (inf-conv). To tackle this problem class we propose to reformulate the problem exploiting its inf-conv structure and derive a block coordinate descent scheme on a Bregman augmented Lagrangian, that can be implemented asynchronously. We prove convergence of our scheme to stationary points of the original model for a specific choice of the penalty parameter. O"},"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":"1803.02487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T00:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"2707646d4754bc8e455d718ef4e39cbe931125c25b99a2aee4995a6bde48b222","abstract_canon_sha256":"6c357d45c0ba81951b716fd5f5bc2944e4bf3a4c248a7d901afd5a5591149da6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:01.680185Z","signature_b64":"eu08rDCsWKUPBTuQxWb/8qIamVrRiGUZs4oAgqFJQRmGxYczczZMmATrU0XaCMR+0jrBCkpMSrfoFwKBq2+xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","last_reissued_at":"2026-05-18T00:20:01.679667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:01.679667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nonlinear Bregman Primal-Dual Framework for Optimizing Nonconvex Infimal Convolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Cremers, Emanuel Laude","submitted_at":"2018-03-07T00:28:07Z","abstract_excerpt":"This work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution (inf-conv). To tackle this problem class we propose to reformulate the problem exploiting its inf-conv structure and derive a block coordinate descent scheme on a Bregman augmented Lagrangian, that can be implemented asynchronously. We prove convergence of our scheme to stationary points of the original model for a specific choice of the penalty parameter. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02487","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":"1803.02487","created_at":"2026-05-18T00:20:01.679740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02487v2","created_at":"2026-05-18T00:20:01.679740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02487","created_at":"2026-05-18T00:20:01.679740+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIKZCM6ENJY7","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIKZCM6ENJY7DSZY","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIKZCM6E","created_at":"2026-05-18T12:32:50.500415+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/RIKZCM6ENJY7DSZYGPWDFETJLK","json":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK.json","graph_json":"https://pith.science/api/pith-number/RIKZCM6ENJY7DSZYGPWDFETJLK/graph.json","events_json":"https://pith.science/api/pith-number/RIKZCM6ENJY7DSZYGPWDFETJLK/events.json","paper":"https://pith.science/paper/RIKZCM6E"},"agent_actions":{"view_html":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK","download_json":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK.json","view_paper":"https://pith.science/paper/RIKZCM6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02487&json=true","fetch_graph":"https://pith.science/api/pith-number/RIKZCM6ENJY7DSZYGPWDFETJLK/graph.json","fetch_events":"https://pith.science/api/pith-number/RIKZCM6ENJY7DSZYGPWDFETJLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/action/storage_attestation","attest_author":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/action/author_attestation","sign_citation":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/action/citation_signature","submit_replication":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/action/replication_record"}},"created_at":"2026-05-18T00:20:01.679740+00:00","updated_at":"2026-05-18T00:20:01.679740+00:00"}