{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:QWUAW2JJHDVUCRDK36JRQ74LUC","short_pith_number":"pith:QWUAW2JJ","schema_version":"1.0","canonical_sha256":"85a80b692938eb41446adf93187f8ba08b11a3e9cd8ddcac45ffcfec15618851","source":{"kind":"arxiv","id":"0801.1780","version":3},"attestation_state":"computed","paper":{"title":"Proximal alternating minimization and projection methods for nonconvex problems. An approach based on the Kurdyka-Lojasiewicz inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antoine Soubeyran, Hedy Attouch, Jerome Bolte, Patrick Redont","submitted_at":"2008-01-11T13:54:05Z","abstract_excerpt":"We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: $L(x,y)=f(x)+Q(x,y)+g(y)$, where $f:\\R^n\\rightarrow\\R\\cup{+\\infty}$ and $g:\\R^m\\rightarrow\\R\\cup{+\\infty}$ are proper lower semicontinuous functions, and $Q:\\R^n\\times\\R^m\\rightarrow \\R$ is a smooth $C^1$ function which couples the variables $x$ and $y$. The algorithm can be viewed as a proximal regularization of the usual Gauss-Seidel method to minimize $L$. We work in a nonconvex setting, just assuming that the function $L$ satisfies the Kurdyka-\\L ojasiewicz "},"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":"0801.1780","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-01-11T13:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"918eb9e995f525a93efe9b6327855730f29f7208610275c0e23da40c3b2aac57","abstract_canon_sha256":"5833f15329bf3f8e8ab8a7d57e766a1aa4572f7621d5d07ec7d6124b3e271b61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:54.744840Z","signature_b64":"MLFuKGvDdFEUsg5FrA/ykCZn1Hc2xkD1Uk83GVr9otsgLwXCBfeDhWrnqDjrdhEyDkhiDKjD8blwKWEPsxfwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85a80b692938eb41446adf93187f8ba08b11a3e9cd8ddcac45ffcfec15618851","last_reissued_at":"2026-05-18T03:35:54.744090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:54.744090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal alternating minimization and projection methods for nonconvex problems. An approach based on the Kurdyka-Lojasiewicz inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antoine Soubeyran, Hedy Attouch, Jerome Bolte, Patrick Redont","submitted_at":"2008-01-11T13:54:05Z","abstract_excerpt":"We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: $L(x,y)=f(x)+Q(x,y)+g(y)$, where $f:\\R^n\\rightarrow\\R\\cup{+\\infty}$ and $g:\\R^m\\rightarrow\\R\\cup{+\\infty}$ are proper lower semicontinuous functions, and $Q:\\R^n\\times\\R^m\\rightarrow \\R$ is a smooth $C^1$ function which couples the variables $x$ and $y$. The algorithm can be viewed as a proximal regularization of the usual Gauss-Seidel method to minimize $L$. We work in a nonconvex setting, just assuming that the function $L$ satisfies the Kurdyka-\\L ojasiewicz "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.1780","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":"0801.1780","created_at":"2026-05-18T03:35:54.744201+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.1780v3","created_at":"2026-05-18T03:35:54.744201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.1780","created_at":"2026-05-18T03:35:54.744201+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWUAW2JJHDVU","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWUAW2JJHDVUCRDK","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWUAW2JJ","created_at":"2026-05-18T12:25:58.018023+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/QWUAW2JJHDVUCRDK36JRQ74LUC","json":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC.json","graph_json":"https://pith.science/api/pith-number/QWUAW2JJHDVUCRDK36JRQ74LUC/graph.json","events_json":"https://pith.science/api/pith-number/QWUAW2JJHDVUCRDK36JRQ74LUC/events.json","paper":"https://pith.science/paper/QWUAW2JJ"},"agent_actions":{"view_html":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC","download_json":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC.json","view_paper":"https://pith.science/paper/QWUAW2JJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.1780&json=true","fetch_graph":"https://pith.science/api/pith-number/QWUAW2JJHDVUCRDK36JRQ74LUC/graph.json","fetch_events":"https://pith.science/api/pith-number/QWUAW2JJHDVUCRDK36JRQ74LUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC/action/storage_attestation","attest_author":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC/action/author_attestation","sign_citation":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC/action/citation_signature","submit_replication":"https://pith.science/pith/QWUAW2JJHDVUCRDK36JRQ74LUC/action/replication_record"}},"created_at":"2026-05-18T03:35:54.744201+00:00","updated_at":"2026-05-18T03:35:54.744201+00:00"}