{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FCWOAATK3WVB3ILYTVCIHEJVB2","short_pith_number":"pith:FCWOAATK","schema_version":"1.0","canonical_sha256":"28ace0026addaa1da1789d448391350eb551db3ee64186d6f4520845a315752f","source":{"kind":"arxiv","id":"2310.07226","version":1},"attestation_state":"computed","paper":{"title":"A Quasi Newton Method for Uncertain Multiobjective Optimization Problems via Robust Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Debdas Ghosh, Md Abu T Ansary, Nihar Kumar Mahato, Shubham Kumar","submitted_at":"2023-10-11T06:27:07Z","abstract_excerpt":"In this paper, we propose a quasi Newton method to solve the robust counterpart of an uncertain multiobjective optimization problem under an arbitrary finite uncertainty set. Here the robust counterpart of an uncertain multiobjective optimization problem is the minimum of objective-wise worst case, which is a nonsmooth deterministic multiobjective optimization problem. In order to solve this robust counterpart with the help of quasi Newton method, we construct a sub-problem using Hessian approximation and solve it to determine a descent direction for the robust counterpart. We introduce an Arm"},"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":"2310.07226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-11T06:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"c0b67e36f65c36a0947015c58c4edecf20808cf22fb67894fbff2e6be3efddb4","abstract_canon_sha256":"a6f9defc3cfcb56c76fa27fec8f0ea848c9272207a21704c57673613b524e850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:42.335971Z","signature_b64":"g5c0AJvOhNlvry2ZBE+qCgxw6Cg7R6ToJHaye4Iz3VtLcaMRq3dwJvj+meaZMJlTkkK3Rq+auKOYgqe1VCNjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28ace0026addaa1da1789d448391350eb551db3ee64186d6f4520845a315752f","last_reissued_at":"2026-07-05T06:59:42.335528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:42.335528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quasi Newton Method for Uncertain Multiobjective Optimization Problems via Robust Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Debdas Ghosh, Md Abu T Ansary, Nihar Kumar Mahato, Shubham Kumar","submitted_at":"2023-10-11T06:27:07Z","abstract_excerpt":"In this paper, we propose a quasi Newton method to solve the robust counterpart of an uncertain multiobjective optimization problem under an arbitrary finite uncertainty set. Here the robust counterpart of an uncertain multiobjective optimization problem is the minimum of objective-wise worst case, which is a nonsmooth deterministic multiobjective optimization problem. In order to solve this robust counterpart with the help of quasi Newton method, we construct a sub-problem using Hessian approximation and solve it to determine a descent direction for the robust counterpart. We introduce an Arm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07226","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/2310.07226/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":"2310.07226","created_at":"2026-07-05T06:59:42.335581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07226v1","created_at":"2026-07-05T06:59:42.335581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07226","created_at":"2026-07-05T06:59:42.335581+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCWOAATK3WVB","created_at":"2026-07-05T06:59:42.335581+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCWOAATK3WVB3ILY","created_at":"2026-07-05T06:59:42.335581+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCWOAATK","created_at":"2026-07-05T06:59:42.335581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04711","citing_title":"Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2","json":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2.json","graph_json":"https://pith.science/api/pith-number/FCWOAATK3WVB3ILYTVCIHEJVB2/graph.json","events_json":"https://pith.science/api/pith-number/FCWOAATK3WVB3ILYTVCIHEJVB2/events.json","paper":"https://pith.science/paper/FCWOAATK"},"agent_actions":{"view_html":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2","download_json":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2.json","view_paper":"https://pith.science/paper/FCWOAATK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07226&json=true","fetch_graph":"https://pith.science/api/pith-number/FCWOAATK3WVB3ILYTVCIHEJVB2/graph.json","fetch_events":"https://pith.science/api/pith-number/FCWOAATK3WVB3ILYTVCIHEJVB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2/action/storage_attestation","attest_author":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2/action/author_attestation","sign_citation":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2/action/citation_signature","submit_replication":"https://pith.science/pith/FCWOAATK3WVB3ILYTVCIHEJVB2/action/replication_record"}},"created_at":"2026-07-05T06:59:42.335581+00:00","updated_at":"2026-07-05T06:59:42.335581+00:00"}