{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:P354HV4XL6R2NMAFYWFGZ3XEL7","short_pith_number":"pith:P354HV4X","schema_version":"1.0","canonical_sha256":"7efbc3d7975fa3a6b005c58a6ceee45fe5cc7f10b17e854666bd205262fafff9","source":{"kind":"arxiv","id":"2205.05262","version":1},"attestation_state":"computed","paper":{"title":"A globally convergent fast iterative shrinkage-thresholding algorithm with a new momentum factor for single and multi-objective convex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Ellen H. Fukuda, Hiroki Tanabe, Nobuo Yamashita","submitted_at":"2022-05-11T04:26:00Z","abstract_excerpt":"Convex-composite optimization, which minimizes an objective function represented by the sum of a differentiable function and a convex one, is widely used in machine learning and signal/image processing. Fast Iterative Shrinkage Thresholding Algorithm (FISTA) is a typical method for solving this problem and has a global convergence rate of $O(1 / k^2)$. Recently, this has been extended to multi-objective optimization, together with the proof of the $O(1 / k^2)$ global convergence rate. However, its momentum factor is classical, and the convergence of its iterates has not been proven. In this wo"},"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":"2205.05262","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-11T04:26:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c7ea2ed5ccbbd1a1dd989672420605073bbe14bbf066742bf1cfc76f0cd922b","abstract_canon_sha256":"3d5052d0243eb2e9f08a0d7c0ba990743408ab4c03bd25ad1b8e506ffe61f042"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:24.042685Z","signature_b64":"LmJXlMJW7EKsVDS+dADaxO+uGgw9h6hRa8vAzzCUx0bcKKBoWN06Q9nO6NVZvCePjFWeNyZqLPs8q7joS/erCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7efbc3d7975fa3a6b005c58a6ceee45fe5cc7f10b17e854666bd205262fafff9","last_reissued_at":"2026-07-05T04:22:24.042280Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:24.042280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A globally convergent fast iterative shrinkage-thresholding algorithm with a new momentum factor for single and multi-objective convex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Ellen H. Fukuda, Hiroki Tanabe, Nobuo Yamashita","submitted_at":"2022-05-11T04:26:00Z","abstract_excerpt":"Convex-composite optimization, which minimizes an objective function represented by the sum of a differentiable function and a convex one, is widely used in machine learning and signal/image processing. Fast Iterative Shrinkage Thresholding Algorithm (FISTA) is a typical method for solving this problem and has a global convergence rate of $O(1 / k^2)$. Recently, this has been extended to multi-objective optimization, together with the proof of the $O(1 / k^2)$ global convergence rate. However, its momentum factor is classical, and the convergence of its iterates has not been proven. In this wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.05262","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.05262/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.05262","created_at":"2026-07-05T04:22:24.042345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.05262v1","created_at":"2026-07-05T04:22:24.042345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.05262","created_at":"2026-07-05T04:22:24.042345+00:00"},{"alias_kind":"pith_short_12","alias_value":"P354HV4XL6R2","created_at":"2026-07-05T04:22:24.042345+00:00"},{"alias_kind":"pith_short_16","alias_value":"P354HV4XL6R2NMAF","created_at":"2026-07-05T04:22:24.042345+00:00"},{"alias_kind":"pith_short_8","alias_value":"P354HV4X","created_at":"2026-07-05T04:22:24.042345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18422","citing_title":"Inertial dynamics with vanishing Tikhonov regularization for multiobjective optimization","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7","json":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7.json","graph_json":"https://pith.science/api/pith-number/P354HV4XL6R2NMAFYWFGZ3XEL7/graph.json","events_json":"https://pith.science/api/pith-number/P354HV4XL6R2NMAFYWFGZ3XEL7/events.json","paper":"https://pith.science/paper/P354HV4X"},"agent_actions":{"view_html":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7","download_json":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7.json","view_paper":"https://pith.science/paper/P354HV4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.05262&json=true","fetch_graph":"https://pith.science/api/pith-number/P354HV4XL6R2NMAFYWFGZ3XEL7/graph.json","fetch_events":"https://pith.science/api/pith-number/P354HV4XL6R2NMAFYWFGZ3XEL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7/action/storage_attestation","attest_author":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7/action/author_attestation","sign_citation":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7/action/citation_signature","submit_replication":"https://pith.science/pith/P354HV4XL6R2NMAFYWFGZ3XEL7/action/replication_record"}},"created_at":"2026-07-05T04:22:24.042345+00:00","updated_at":"2026-07-05T04:22:24.042345+00:00"}