{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WMJMBXPGMKM7QTJNXFQOPJIVMJ","short_pith_number":"pith:WMJMBXPG","schema_version":"1.0","canonical_sha256":"b312c0dde66299f84d2db960e7a515627d16d7c85ba2f05f3ee2bf2efb2ff25d","source":{"kind":"arxiv","id":"2501.07863","version":5},"attestation_state":"computed","paper":{"title":"An accelerated gradient method with adaptive restart for convex multiobjective optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Hao Luo, Liping Tang, Xinmin Yang","submitted_at":"2025-01-14T05:59:37Z","abstract_excerpt":"In this work, based on the continuous time approach, we propose an accelerated gradient method with adaptive residual restart for convex multiobjective optimization problems. For the first, we derive rigorously the continuous limit of the multiobjective accelerated proximal gradient method by Tanabe et al. [Comput. Optim. Appl., 2023]. It is a second-order ordinary differential equation (ODE) that involves a special projection operator and can be viewed as an extension of the ODE by Su et al. [J. Mach. Learn. Res., 2016] for Nesterov acceleration. Then, we introduce a novel accelerated multiob"},"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":"2501.07863","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-14T05:59:37Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"7cf1e419934cb520862064cfb45f02c6d56eb15a0c37cb4d962ba35181e21509","abstract_canon_sha256":"a597195ff1f6c6d98c2d1c05ced647ca5204439fcd621f6083f55c2d81668225"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:51.381343Z","signature_b64":"lYsE2VeN/GUswHrm2uouaPtMYlT0WoCBYv8yM89QjauUXO9xr21tNJ7qQspsNv9Ui6Gl/xb3RbgZJiwnxlkODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b312c0dde66299f84d2db960e7a515627d16d7c85ba2f05f3ee2bf2efb2ff25d","last_reissued_at":"2026-07-05T10:09:51.380833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:51.380833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An accelerated gradient method with adaptive restart for convex multiobjective optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Hao Luo, Liping Tang, Xinmin Yang","submitted_at":"2025-01-14T05:59:37Z","abstract_excerpt":"In this work, based on the continuous time approach, we propose an accelerated gradient method with adaptive residual restart for convex multiobjective optimization problems. For the first, we derive rigorously the continuous limit of the multiobjective accelerated proximal gradient method by Tanabe et al. [Comput. Optim. Appl., 2023]. It is a second-order ordinary differential equation (ODE) that involves a special projection operator and can be viewed as an extension of the ODE by Su et al. [J. Mach. Learn. Res., 2016] for Nesterov acceleration. Then, we introduce a novel accelerated multiob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07863","kind":"arxiv","version":5},"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/2501.07863/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":"2501.07863","created_at":"2026-07-05T10:09:51.380897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07863v5","created_at":"2026-07-05T10:09:51.380897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07863","created_at":"2026-07-05T10:09:51.380897+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMJMBXPGMKM7","created_at":"2026-07-05T10:09:51.380897+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMJMBXPGMKM7QTJN","created_at":"2026-07-05T10:09:51.380897+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMJMBXPG","created_at":"2026-07-05T10:09:51.380897+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.11267","citing_title":"Towards faster first order methods: A continuous-time model to interpolate between speed and function value restart","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ","json":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ.json","graph_json":"https://pith.science/api/pith-number/WMJMBXPGMKM7QTJNXFQOPJIVMJ/graph.json","events_json":"https://pith.science/api/pith-number/WMJMBXPGMKM7QTJNXFQOPJIVMJ/events.json","paper":"https://pith.science/paper/WMJMBXPG"},"agent_actions":{"view_html":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ","download_json":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ.json","view_paper":"https://pith.science/paper/WMJMBXPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07863&json=true","fetch_graph":"https://pith.science/api/pith-number/WMJMBXPGMKM7QTJNXFQOPJIVMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WMJMBXPGMKM7QTJNXFQOPJIVMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ/action/storage_attestation","attest_author":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ/action/author_attestation","sign_citation":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ/action/citation_signature","submit_replication":"https://pith.science/pith/WMJMBXPGMKM7QTJNXFQOPJIVMJ/action/replication_record"}},"created_at":"2026-07-05T10:09:51.380897+00:00","updated_at":"2026-07-05T10:09:51.380897+00:00"}