{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BV27KYF7CHWKEHP43M7BZRHC6F","short_pith_number":"pith:BV27KYF7","schema_version":"1.0","canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","source":{"kind":"arxiv","id":"1306.5918","version":2},"attestation_state":"computed","paper":{"title":"A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Lin Xiao, Zhaosong Lu","submitted_at":"2013-06-25T11:11:42Z","abstract_excerpt":"We propose a randomized nonmonotone block proximal gradient (RNBPG) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function. At each iteration, this method randomly picks a block according to any prescribed probability distribution and solves typically several associated proximal subproblems that usually have a closed-form solution, until a certain progress on objective value is achieved. In contrast to the usual randomized block coordinate descent method [23,20], our method has a nonmonotone flavor and uses variable"},"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":"1306.5918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-25T11:11:42Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"2dfde538a022f26dfdc16729bda14441812ee6bb73f065c802e8118f14171da3","abstract_canon_sha256":"071ce77574a7e977ee36250d5e4c23ab647c8c2229fa92ad77eecefa514c8298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:47.804936Z","signature_b64":"Hed64Un3/fwwLYx0+zWry9d1OX9Ur7orxgcOJMae67hFB+CYNmBSVL8CaqqjwnAYaTlGeIdMDgEDVa23a5nZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d75f560bf11eca21dfcdb3e1cc4e2f146577295e37f18ecedee7576482dfa09","last_reissued_at":"2026-05-18T02:20:47.804208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:47.804208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Lin Xiao, Zhaosong Lu","submitted_at":"2013-06-25T11:11:42Z","abstract_excerpt":"We propose a randomized nonmonotone block proximal gradient (RNBPG) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function. At each iteration, this method randomly picks a block according to any prescribed probability distribution and solves typically several associated proximal subproblems that usually have a closed-form solution, until a certain progress on objective value is achieved. In contrast to the usual randomized block coordinate descent method [23,20], our method has a nonmonotone flavor and uses variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5918","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":"1306.5918","created_at":"2026-05-18T02:20:47.804336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5918v2","created_at":"2026-05-18T02:20:47.804336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5918","created_at":"2026-05-18T02:20:47.804336+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV27KYF7CHWK","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV27KYF7CHWKEHP4","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV27KYF7","created_at":"2026-05-18T12:27:40.988391+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/BV27KYF7CHWKEHP43M7BZRHC6F","json":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F.json","graph_json":"https://pith.science/api/pith-number/BV27KYF7CHWKEHP43M7BZRHC6F/graph.json","events_json":"https://pith.science/api/pith-number/BV27KYF7CHWKEHP43M7BZRHC6F/events.json","paper":"https://pith.science/paper/BV27KYF7"},"agent_actions":{"view_html":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F","download_json":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F.json","view_paper":"https://pith.science/paper/BV27KYF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5918&json=true","fetch_graph":"https://pith.science/api/pith-number/BV27KYF7CHWKEHP43M7BZRHC6F/graph.json","fetch_events":"https://pith.science/api/pith-number/BV27KYF7CHWKEHP43M7BZRHC6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/action/storage_attestation","attest_author":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/action/author_attestation","sign_citation":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/action/citation_signature","submit_replication":"https://pith.science/pith/BV27KYF7CHWKEHP43M7BZRHC6F/action/replication_record"}},"created_at":"2026-05-18T02:20:47.804336+00:00","updated_at":"2026-05-18T02:20:47.804336+00:00"}