{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GMJDNQ3FHDBWTA44QX6N6UIJVH","short_pith_number":"pith:GMJDNQ3F","schema_version":"1.0","canonical_sha256":"331236c36538c369839c85fcdf5109a9ed1c7650bc894ad678887fbb6dd951d8","source":{"kind":"arxiv","id":"2212.12256","version":1},"attestation_state":"computed","paper":{"title":"On a fixed-point continuation method for a convex optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Gesa Sarnighausen, Ignace Loris, Jean-Baptiste Fest, Luca Ratti, S\\'egol\\`ene Martin, Simone Rebegoldi, Tommi Heikkil\\\"a","submitted_at":"2022-12-23T11:08:01Z","abstract_excerpt":"We consider a variation of the classical proximal-gradient algorithm for the iterative minimization of a cost function consisting of a sum of two terms, one smooth and the other prox-simple, and whose relative weight is determined by a penalty parameter. This so-called fixed-point continuation method allows one to approximate the problem's trade-off curve, i.e. to compute the minimizers of the cost function for a whole range of values of the penalty parameter at once. The algorithm is shown to converge, and a rate of convergence of the cost function is also derived. Furthermore, it is shown th"},"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":"2212.12256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-23T11:08:01Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"6bb15278c5fe42a524bd477c484b2ed02f36df5156b3d9c5e79e1aa1655dfdd6","abstract_canon_sha256":"b13b1f0ddf358c6a33fca1a2361224021bfcd687ec6839e7cf743590f3e57c53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:05.699781Z","signature_b64":"lcOnnAI/bLOpoyQ6XEQF/arT9CM4HTrssmdEFa3LOr30lPmIydF0tMQ7/3RwuXSS7xwHhK9O2/Ipdkoi497LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"331236c36538c369839c85fcdf5109a9ed1c7650bc894ad678887fbb6dd951d8","last_reissued_at":"2026-07-05T09:15:05.699285Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:05.699285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a fixed-point continuation method for a convex optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Gesa Sarnighausen, Ignace Loris, Jean-Baptiste Fest, Luca Ratti, S\\'egol\\`ene Martin, Simone Rebegoldi, Tommi Heikkil\\\"a","submitted_at":"2022-12-23T11:08:01Z","abstract_excerpt":"We consider a variation of the classical proximal-gradient algorithm for the iterative minimization of a cost function consisting of a sum of two terms, one smooth and the other prox-simple, and whose relative weight is determined by a penalty parameter. This so-called fixed-point continuation method allows one to approximate the problem's trade-off curve, i.e. to compute the minimizers of the cost function for a whole range of values of the penalty parameter at once. The algorithm is shown to converge, and a rate of convergence of the cost function is also derived. Furthermore, it is shown th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12256","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.12256/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2212.12256","created_at":"2026-07-05T09:15:05.699352+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.12256v1","created_at":"2026-07-05T09:15:05.699352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12256","created_at":"2026-07-05T09:15:05.699352+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMJDNQ3FHDBW","created_at":"2026-07-05T09:15:05.699352+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMJDNQ3FHDBWTA44","created_at":"2026-07-05T09:15:05.699352+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMJDNQ3F","created_at":"2026-07-05T09:15:05.699352+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/GMJDNQ3FHDBWTA44QX6N6UIJVH","json":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH.json","graph_json":"https://pith.science/api/pith-number/GMJDNQ3FHDBWTA44QX6N6UIJVH/graph.json","events_json":"https://pith.science/api/pith-number/GMJDNQ3FHDBWTA44QX6N6UIJVH/events.json","paper":"https://pith.science/paper/GMJDNQ3F"},"agent_actions":{"view_html":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH","download_json":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH.json","view_paper":"https://pith.science/paper/GMJDNQ3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.12256&json=true","fetch_graph":"https://pith.science/api/pith-number/GMJDNQ3FHDBWTA44QX6N6UIJVH/graph.json","fetch_events":"https://pith.science/api/pith-number/GMJDNQ3FHDBWTA44QX6N6UIJVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH/action/storage_attestation","attest_author":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH/action/author_attestation","sign_citation":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH/action/citation_signature","submit_replication":"https://pith.science/pith/GMJDNQ3FHDBWTA44QX6N6UIJVH/action/replication_record"}},"created_at":"2026-07-05T09:15:05.699352+00:00","updated_at":"2026-07-05T09:15:05.699352+00:00"}