{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:333LF7LZMB6XAH4OLHAP4ZNFXC","short_pith_number":"pith:333LF7LZ","schema_version":"1.0","canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","source":{"kind":"arxiv","id":"1112.5407","version":3},"attestation_state":"computed","paper":{"title":"Alternating proximal gradient method for nonnegative matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Yangyang Xu","submitted_at":"2011-12-22T18:22:59Z","abstract_excerpt":"Nonnegative matrix factorization has been widely applied in face recognition, text mining, as well as spectral analysis. This paper proposes an alternating proximal gradient method for solving this problem. With a uniformly positive lower bound assumption on the iterates, any limit point can be proved to satisfy the first-order optimality conditions. A Nesterov-type extrapolation technique is then applied to accelerate the algorithm. Though this technique is at first used for convex program, it turns out to work very well for the non-convex nonnegative matrix factorization problem. Extensive n"},"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":"1112.5407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-22T18:22:59Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"838f25670db41f7b0a55cc86a3f10fa335ed88137b892dbce848a4d529b314fb","abstract_canon_sha256":"f2ac4ac4b5aeb7a6aaae3ef273cac7035beb152c9ff52369cdf305bf443e7f58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:03.415663Z","signature_b64":"vihjwJ2dWUzQWZ/EMY0EyP2jKMnmi1J+LwJpy3JVXHrt+e6TD6tOWhACfOCcUoIqKujupBWTWUTeuz+K+kHdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def6b2fd79607d701f8e59c0fe65a5b88bd044ea13aad240bf31e9d09be1a446","last_reissued_at":"2026-05-18T03:34:03.414841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:03.414841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating proximal gradient method for nonnegative matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Yangyang Xu","submitted_at":"2011-12-22T18:22:59Z","abstract_excerpt":"Nonnegative matrix factorization has been widely applied in face recognition, text mining, as well as spectral analysis. This paper proposes an alternating proximal gradient method for solving this problem. With a uniformly positive lower bound assumption on the iterates, any limit point can be proved to satisfy the first-order optimality conditions. A Nesterov-type extrapolation technique is then applied to accelerate the algorithm. Though this technique is at first used for convex program, it turns out to work very well for the non-convex nonnegative matrix factorization problem. Extensive n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5407","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":"1112.5407","created_at":"2026-05-18T03:34:03.414968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5407v3","created_at":"2026-05-18T03:34:03.414968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5407","created_at":"2026-05-18T03:34:03.414968+00:00"},{"alias_kind":"pith_short_12","alias_value":"333LF7LZMB6X","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"333LF7LZMB6XAH4O","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"333LF7LZ","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19325","citing_title":"An Exterior Method for Nonnegative Matrix Factorization","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC","json":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC.json","graph_json":"https://pith.science/api/pith-number/333LF7LZMB6XAH4OLHAP4ZNFXC/graph.json","events_json":"https://pith.science/api/pith-number/333LF7LZMB6XAH4OLHAP4ZNFXC/events.json","paper":"https://pith.science/paper/333LF7LZ"},"agent_actions":{"view_html":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC","download_json":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC.json","view_paper":"https://pith.science/paper/333LF7LZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5407&json=true","fetch_graph":"https://pith.science/api/pith-number/333LF7LZMB6XAH4OLHAP4ZNFXC/graph.json","fetch_events":"https://pith.science/api/pith-number/333LF7LZMB6XAH4OLHAP4ZNFXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/action/storage_attestation","attest_author":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/action/author_attestation","sign_citation":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/action/citation_signature","submit_replication":"https://pith.science/pith/333LF7LZMB6XAH4OLHAP4ZNFXC/action/replication_record"}},"created_at":"2026-05-18T03:34:03.414968+00:00","updated_at":"2026-05-18T03:34:03.414968+00:00"}