{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M52OTN3TJSJPWGMCUYGLD7KSWI","short_pith_number":"pith:M52OTN3T","schema_version":"1.0","canonical_sha256":"6774e9b7734c92fb1982a60cb1fd52b2259cffffd55a4af304c7a2e8a0a44061","source":{"kind":"arxiv","id":"2312.02461","version":3},"attestation_state":"computed","paper":{"title":"Conjugate gradient methods without line search for multiobjective optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liping Tang, Wang Chen, Xinmin Yang, Yong Zhao","submitted_at":"2023-12-05T03:23:36Z","abstract_excerpt":"This paper addresses unconstrained multiobjective optimization problems where two or more continuously differentiable functions have to be minimized. We delve into the conjugate gradient methods proposed by Lucambio P\\'{e}rez and Prudente (SIAM J Optim, 28(3): 2690--2720, 2018) for such problems. Instead of the Wolfe-type line search procedure used in their work, we employ a fixed stepsize formula (or no-line-search scheme), which can mitigate the pressure of choosing stepsize caused by multiple inequalities and avoid the computational cost associated with function evaluations in specific appl"},"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":"2312.02461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-05T03:23:36Z","cross_cats_sorted":[],"title_canon_sha256":"5fb868befca71c7d84e9acb2661cf01d1289c90b4d4b0904f63a100ba7821abe","abstract_canon_sha256":"83389c4edf8ba2c8e9e440a9f78662c6ded2b5066e52ce2c43a1d87056993f3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:25.305232Z","signature_b64":"cLM1uyProAgsBNaQCWTSH5t9hgsVlcJKJ1SCA8h7BfDp3Owjbm6bAtHCyWJTuvn819M8mlv3tgZt/Tl4YyQTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6774e9b7734c92fb1982a60cb1fd52b2259cffffd55a4af304c7a2e8a0a44061","last_reissued_at":"2026-07-05T09:19:25.304776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:25.304776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conjugate gradient methods without line search for multiobjective optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liping Tang, Wang Chen, Xinmin Yang, Yong Zhao","submitted_at":"2023-12-05T03:23:36Z","abstract_excerpt":"This paper addresses unconstrained multiobjective optimization problems where two or more continuously differentiable functions have to be minimized. We delve into the conjugate gradient methods proposed by Lucambio P\\'{e}rez and Prudente (SIAM J Optim, 28(3): 2690--2720, 2018) for such problems. Instead of the Wolfe-type line search procedure used in their work, we employ a fixed stepsize formula (or no-line-search scheme), which can mitigate the pressure of choosing stepsize caused by multiple inequalities and avoid the computational cost associated with function evaluations in specific appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02461","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.02461/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":"2312.02461","created_at":"2026-07-05T09:19:25.304832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02461v3","created_at":"2026-07-05T09:19:25.304832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02461","created_at":"2026-07-05T09:19:25.304832+00:00"},{"alias_kind":"pith_short_12","alias_value":"M52OTN3TJSJP","created_at":"2026-07-05T09:19:25.304832+00:00"},{"alias_kind":"pith_short_16","alias_value":"M52OTN3TJSJPWGMC","created_at":"2026-07-05T09:19:25.304832+00:00"},{"alias_kind":"pith_short_8","alias_value":"M52OTN3T","created_at":"2026-07-05T09:19:25.304832+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/M52OTN3TJSJPWGMCUYGLD7KSWI","json":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI.json","graph_json":"https://pith.science/api/pith-number/M52OTN3TJSJPWGMCUYGLD7KSWI/graph.json","events_json":"https://pith.science/api/pith-number/M52OTN3TJSJPWGMCUYGLD7KSWI/events.json","paper":"https://pith.science/paper/M52OTN3T"},"agent_actions":{"view_html":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI","download_json":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI.json","view_paper":"https://pith.science/paper/M52OTN3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02461&json=true","fetch_graph":"https://pith.science/api/pith-number/M52OTN3TJSJPWGMCUYGLD7KSWI/graph.json","fetch_events":"https://pith.science/api/pith-number/M52OTN3TJSJPWGMCUYGLD7KSWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI/action/storage_attestation","attest_author":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI/action/author_attestation","sign_citation":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI/action/citation_signature","submit_replication":"https://pith.science/pith/M52OTN3TJSJPWGMCUYGLD7KSWI/action/replication_record"}},"created_at":"2026-07-05T09:19:25.304832+00:00","updated_at":"2026-07-05T09:19:25.304832+00:00"}