{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:34H5G7WZJRFFHJYZOVTYZ7MADA","short_pith_number":"pith:34H5G7WZ","schema_version":"1.0","canonical_sha256":"df0fd37ed94c4a53a71975678cfd8018137252a513c14838a46bb63c70e19a5c","source":{"kind":"arxiv","id":"1502.06737","version":1},"attestation_state":"computed","paper":{"title":"A cyclic block coordinate descent method with generalized gradient projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Marco Prato, Silvia Bonettini, Simone Rebegoldi","submitted_at":"2015-02-24T09:58:31Z","abstract_excerpt":"The aim of this paper is to present the convergence analysis of a very general class of gradient projection methods for smooth, constrained, possibly nonconvex, optimization. The key features of these methods are the Armijo linesearch along a suitable descent direction and the non Euclidean metric employed to compute the gradient projection. We develop a very general framework from the point of view of block--coordinate descent methods, which are useful when the constraints are separable."},"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":"1502.06737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-02-24T09:58:31Z","cross_cats_sorted":[],"title_canon_sha256":"3d22f779056402d51c1a1d3c4af7a153ac3a738f848822e7983860ab9c55b652","abstract_canon_sha256":"c8cd4ae869f56191e94a49f4cc42c8e98b16d57dd5ecb355d9ed8de276834613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.452721Z","signature_b64":"gV1EwyfSE5zvC32w1jpmFP/yL4vu+NM+nv4TO9xy7aS8HKRNL2NCCynudEBsZ34/KUzIlWJVTB7hrWL9MC4xDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0fd37ed94c4a53a71975678cfd8018137252a513c14838a46bb63c70e19a5c","last_reissued_at":"2026-05-18T01:15:00.452217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.452217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A cyclic block coordinate descent method with generalized gradient projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Marco Prato, Silvia Bonettini, Simone Rebegoldi","submitted_at":"2015-02-24T09:58:31Z","abstract_excerpt":"The aim of this paper is to present the convergence analysis of a very general class of gradient projection methods for smooth, constrained, possibly nonconvex, optimization. The key features of these methods are the Armijo linesearch along a suitable descent direction and the non Euclidean metric employed to compute the gradient projection. We develop a very general framework from the point of view of block--coordinate descent methods, which are useful when the constraints are separable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06737","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":""},"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":"1502.06737","created_at":"2026-05-18T01:15:00.452300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06737v1","created_at":"2026-05-18T01:15:00.452300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06737","created_at":"2026-05-18T01:15:00.452300+00:00"},{"alias_kind":"pith_short_12","alias_value":"34H5G7WZJRFF","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"34H5G7WZJRFFHJYZ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"34H5G7WZ","created_at":"2026-05-18T12:29:02.477457+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/34H5G7WZJRFFHJYZOVTYZ7MADA","json":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA.json","graph_json":"https://pith.science/api/pith-number/34H5G7WZJRFFHJYZOVTYZ7MADA/graph.json","events_json":"https://pith.science/api/pith-number/34H5G7WZJRFFHJYZOVTYZ7MADA/events.json","paper":"https://pith.science/paper/34H5G7WZ"},"agent_actions":{"view_html":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA","download_json":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA.json","view_paper":"https://pith.science/paper/34H5G7WZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06737&json=true","fetch_graph":"https://pith.science/api/pith-number/34H5G7WZJRFFHJYZOVTYZ7MADA/graph.json","fetch_events":"https://pith.science/api/pith-number/34H5G7WZJRFFHJYZOVTYZ7MADA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA/action/storage_attestation","attest_author":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA/action/author_attestation","sign_citation":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA/action/citation_signature","submit_replication":"https://pith.science/pith/34H5G7WZJRFFHJYZOVTYZ7MADA/action/replication_record"}},"created_at":"2026-05-18T01:15:00.452300+00:00","updated_at":"2026-05-18T01:15:00.452300+00:00"}