{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6CDRWUHYIGJL7W7BXMTJSAVVMZ","short_pith_number":"pith:6CDRWUHY","schema_version":"1.0","canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","source":{"kind":"arxiv","id":"2306.09797","version":2},"attestation_state":"computed","paper":{"title":"Barzilai-Borwein Proximal Gradient Methods for Multiobjective Composite Optimization Problems with Improved Linear Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian Chen, Liping Tang, Xinmin Yang","submitted_at":"2023-06-16T12:10:09Z","abstract_excerpt":"When minimizing a multiobjective optimization problem (MOP) using multiobjective gradient descent methods, the imbalances among objective functions often decelerate the convergence. In response to this challenge, we propose two types of the Barzilai-Borwein proximal gradient method for multi-objective composite optimization problems (BBPGMO). We establish convergence rates for BBPGMO, demonstrating that it achieves rates of $O(\\frac{1}{\\sqrt{k}})$, $O(\\frac{1}{k})$, and $O(r^{k})(0<r<1)$ for non-convex, convex, and strongly convex problems, respectively. Furthermore, we show that BBPGMO exhibi"},"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":"2306.09797","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T12:10:09Z","cross_cats_sorted":[],"title_canon_sha256":"43da8364aa8186fb02bb064e81fd870131c63ad7681e4737398b04822497be73","abstract_canon_sha256":"cc846734fa131aed7704cde2580e51503a9c2ea756530f3812709593574fd121"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:35.939021Z","signature_b64":"yBYxwHNjZKyANWemYcwGaRoZExMgwSHURK+/hnGHSQRgv5lKGzRn9ZYK2nl8HVhl9ZN6nr8R/xTnQoA65rmpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","last_reissued_at":"2026-07-05T06:39:35.938552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:35.938552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Barzilai-Borwein Proximal Gradient Methods for Multiobjective Composite Optimization Problems with Improved Linear Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian Chen, Liping Tang, Xinmin Yang","submitted_at":"2023-06-16T12:10:09Z","abstract_excerpt":"When minimizing a multiobjective optimization problem (MOP) using multiobjective gradient descent methods, the imbalances among objective functions often decelerate the convergence. In response to this challenge, we propose two types of the Barzilai-Borwein proximal gradient method for multi-objective composite optimization problems (BBPGMO). We establish convergence rates for BBPGMO, demonstrating that it achieves rates of $O(\\frac{1}{\\sqrt{k}})$, $O(\\frac{1}{k})$, and $O(r^{k})(0<r<1)$ for non-convex, convex, and strongly convex problems, respectively. Furthermore, we show that BBPGMO exhibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09797","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.09797/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":"2306.09797","created_at":"2026-07-05T06:39:35.938608+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.09797v2","created_at":"2026-07-05T06:39:35.938608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09797","created_at":"2026-07-05T06:39:35.938608+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CDRWUHYIGJL","created_at":"2026-07-05T06:39:35.938608+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CDRWUHYIGJL7W7B","created_at":"2026-07-05T06:39:35.938608+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CDRWUHY","created_at":"2026-07-05T06:39:35.938608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26792","citing_title":"Second-order Methods for Multiobjective Composite Optimization: Preconditioning Strategies, Subspace Variants and Inexact Solutions","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2405.08450","citing_title":"Effective Front-Descent Algorithms with Convergence Guarantees","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ","json":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ.json","graph_json":"https://pith.science/api/pith-number/6CDRWUHYIGJL7W7BXMTJSAVVMZ/graph.json","events_json":"https://pith.science/api/pith-number/6CDRWUHYIGJL7W7BXMTJSAVVMZ/events.json","paper":"https://pith.science/paper/6CDRWUHY"},"agent_actions":{"view_html":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ","download_json":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ.json","view_paper":"https://pith.science/paper/6CDRWUHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.09797&json=true","fetch_graph":"https://pith.science/api/pith-number/6CDRWUHYIGJL7W7BXMTJSAVVMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6CDRWUHYIGJL7W7BXMTJSAVVMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/action/storage_attestation","attest_author":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/action/author_attestation","sign_citation":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/action/citation_signature","submit_replication":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/action/replication_record"}},"created_at":"2026-07-05T06:39:35.938608+00:00","updated_at":"2026-07-05T06:39:35.938608+00:00"}