{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GQZ2NVDLQO7CYKN7ILHK3VN5GD","short_pith_number":"pith:GQZ2NVDL","schema_version":"1.0","canonical_sha256":"3433a6d46b83be2c29bf42ceadd5bd30f71afd5b8e3f121dfa33327e0df46101","source":{"kind":"arxiv","id":"1802.07072","version":2},"attestation_state":"computed","paper":{"title":"Composite Optimization by Nonconvex Majorization-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.NA"],"primary_cat":"math.OC","authors_text":"Jonas Geiping, Michael Moeller","submitted_at":"2018-02-20T11:59:33Z","abstract_excerpt":"The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g. gradient descent, utilize convex majorizers in order to guarantee that the majorizer is easy to minimize. In our work we consider a natural class of nonconvex majorizers for these functions, and show that these majorizers are still sufficient for a globally convergent optimizat"},"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":"1802.07072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T11:59:33Z","cross_cats_sorted":["cs.CV","math.NA"],"title_canon_sha256":"81767075a61750b569eced1186dfb91dd8da576fe30b189c5d6e85f0f056a156","abstract_canon_sha256":"4a0d87b71100fa4a34332b6f28be6623edb6af2a401caee58e17a6a6543fede6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:40.647110Z","signature_b64":"e1yTaJZcYstBYtl7UUqZaIhtXiArRe07tnXfPiWKmRSkWUObdP7cn2h4lL+9h2BQFPMBo+W413mifExoagSOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3433a6d46b83be2c29bf42ceadd5bd30f71afd5b8e3f121dfa33327e0df46101","last_reissued_at":"2026-05-18T00:06:40.646522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:40.646522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composite Optimization by Nonconvex Majorization-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.NA"],"primary_cat":"math.OC","authors_text":"Jonas Geiping, Michael Moeller","submitted_at":"2018-02-20T11:59:33Z","abstract_excerpt":"The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g. gradient descent, utilize convex majorizers in order to guarantee that the majorizer is easy to minimize. In our work we consider a natural class of nonconvex majorizers for these functions, and show that these majorizers are still sufficient for a globally convergent optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07072","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":"1802.07072","created_at":"2026-05-18T00:06:40.646615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07072v2","created_at":"2026-05-18T00:06:40.646615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07072","created_at":"2026-05-18T00:06:40.646615+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQZ2NVDLQO7C","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQZ2NVDLQO7CYKN7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQZ2NVDL","created_at":"2026-05-18T12:32:25.280505+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/GQZ2NVDLQO7CYKN7ILHK3VN5GD","json":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD.json","graph_json":"https://pith.science/api/pith-number/GQZ2NVDLQO7CYKN7ILHK3VN5GD/graph.json","events_json":"https://pith.science/api/pith-number/GQZ2NVDLQO7CYKN7ILHK3VN5GD/events.json","paper":"https://pith.science/paper/GQZ2NVDL"},"agent_actions":{"view_html":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD","download_json":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD.json","view_paper":"https://pith.science/paper/GQZ2NVDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07072&json=true","fetch_graph":"https://pith.science/api/pith-number/GQZ2NVDLQO7CYKN7ILHK3VN5GD/graph.json","fetch_events":"https://pith.science/api/pith-number/GQZ2NVDLQO7CYKN7ILHK3VN5GD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD/action/storage_attestation","attest_author":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD/action/author_attestation","sign_citation":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD/action/citation_signature","submit_replication":"https://pith.science/pith/GQZ2NVDLQO7CYKN7ILHK3VN5GD/action/replication_record"}},"created_at":"2026-05-18T00:06:40.646615+00:00","updated_at":"2026-05-18T00:06:40.646615+00:00"}