{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CNRWB77ID7VVXDHVFNMPP4KFTT","short_pith_number":"pith:CNRWB77I","schema_version":"1.0","canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","source":{"kind":"arxiv","id":"2304.03641","version":4},"attestation_state":"computed","paper":{"title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ganzhao Yuan","submitted_at":"2023-04-07T13:44:59Z","abstract_excerpt":"Nonsmooth composite optimization with orthogonality constraints has a wide range of applications in statistical learning and data science. However, this problem is challenging due to its nonsmooth objective and computationally expensive nonconvex constraints. In this paper, we propose a new approach called \\textbf{OBCD}, which leverages block coordinate descent to address these challenges. \\textbf{OBCD} is a feasible method with a small computational footprint. In each iteration, it updates \\(k\\) rows of the solution matrix, where \\(k \\geq 2\\), by globally solving a small nonsmooth optimizatio"},"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":"2304.03641","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-07T13:44:59Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"0ab09673df2a32c7910f6aa4f84a0e8ae1942e0310f21c4400f1ccc19e3f1bdb","abstract_canon_sha256":"e0055bca35d65cee2f82c0f9e52b16da99f8eca6a16fe055f3e61bf6aa8bd56a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.889746Z","signature_b64":"0rUpdXrLhk+P3bI7sT00gRw5gciFDDqu0C8liJt/zxRw5xtaIlgihOXnT2p4roR2OojnrcgR/eYz/4YBFGtuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","last_reissued_at":"2026-05-17T23:39:01.888703Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.888703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ganzhao Yuan","submitted_at":"2023-04-07T13:44:59Z","abstract_excerpt":"Nonsmooth composite optimization with orthogonality constraints has a wide range of applications in statistical learning and data science. However, this problem is challenging due to its nonsmooth objective and computationally expensive nonconvex constraints. In this paper, we propose a new approach called \\textbf{OBCD}, which leverages block coordinate descent to address these challenges. \\textbf{OBCD} is a feasible method with a small computational footprint. In each iteration, it updates \\(k\\) rows of the solution matrix, where \\(k \\geq 2\\), by globally solving a small nonsmooth optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03641","kind":"arxiv","version":4},"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":"2304.03641","created_at":"2026-05-17T23:39:01.889170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03641v4","created_at":"2026-05-17T23:39:01.889170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03641","created_at":"2026-05-17T23:39:01.889170+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNRWB77ID7VV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNRWB77ID7VVXDHV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNRWB77I","created_at":"2026-05-18T12:33:33.725879+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/CNRWB77ID7VVXDHVFNMPP4KFTT","json":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT.json","graph_json":"https://pith.science/api/pith-number/CNRWB77ID7VVXDHVFNMPP4KFTT/graph.json","events_json":"https://pith.science/api/pith-number/CNRWB77ID7VVXDHVFNMPP4KFTT/events.json","paper":"https://pith.science/paper/CNRWB77I"},"agent_actions":{"view_html":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT","download_json":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT.json","view_paper":"https://pith.science/paper/CNRWB77I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03641&json=true","fetch_graph":"https://pith.science/api/pith-number/CNRWB77ID7VVXDHVFNMPP4KFTT/graph.json","fetch_events":"https://pith.science/api/pith-number/CNRWB77ID7VVXDHVFNMPP4KFTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/action/storage_attestation","attest_author":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/action/author_attestation","sign_citation":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/action/citation_signature","submit_replication":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/action/replication_record"}},"created_at":"2026-05-17T23:39:01.889170+00:00","updated_at":"2026-05-17T23:39:01.889170+00:00"}