{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DVFY5ZWTCZNE634ST54Y6O45DV","short_pith_number":"pith:DVFY5ZWT","schema_version":"1.0","canonical_sha256":"1d4b8ee6d3165a4f6f929f798f3b9d1d6565527527229ce7b4ac68b3df7c6f35","source":{"kind":"arxiv","id":"2502.02010","version":1},"attestation_state":"computed","paper":{"title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Duc Anh, Tran Ngoc Thang","submitted_at":"2025-02-04T04:58:09Z","abstract_excerpt":"This paper proposes a new steepest gradient descent method for solving nonconvex finite minimax problems using non-monotone adaptive step sizes and providing proof of convergence results in cases of the nonconvex, quasiconvex, and pseudoconvex differentiate component functions. The proposed method is applied using a referenced-based approach to solve the nonconvex multiobjective programming problems. The convergence to weakly efficient or Pareto stationary solutions is proved for pseudoconvex or quasiconvex multiobjective optimization problems, respectively. A variety of numerical experiments "},"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":"2502.02010","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-04T04:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"d0968d133fa2c4de8ec8a99f9a0c4aeef66b6f6c1e09d2d8e554a5cd0a423b86","abstract_canon_sha256":"c1b91d6bdafbe68bb60aa14207c965b361d6e7c6c68167d06ccc80643c49a137"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:22.281755Z","signature_b64":"U5NUVBDd8qfdYWn1J3GiqIw/UZmWGGpBVf7S5hzj81R1Z9elxGHOXv63nBiLp0EBF102bOg0O1Hq8f9AsS+kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d4b8ee6d3165a4f6f929f798f3b9d1d6565527527229ce7b4ac68b3df7c6f35","last_reissued_at":"2026-07-05T10:09:22.281311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:22.281311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Duc Anh, Tran Ngoc Thang","submitted_at":"2025-02-04T04:58:09Z","abstract_excerpt":"This paper proposes a new steepest gradient descent method for solving nonconvex finite minimax problems using non-monotone adaptive step sizes and providing proof of convergence results in cases of the nonconvex, quasiconvex, and pseudoconvex differentiate component functions. The proposed method is applied using a referenced-based approach to solve the nonconvex multiobjective programming problems. The convergence to weakly efficient or Pareto stationary solutions is proved for pseudoconvex or quasiconvex multiobjective optimization problems, respectively. A variety of numerical experiments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02010","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/2502.02010/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":"2502.02010","created_at":"2026-07-05T10:09:22.281374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02010v1","created_at":"2026-07-05T10:09:22.281374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02010","created_at":"2026-07-05T10:09:22.281374+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVFY5ZWTCZNE","created_at":"2026-07-05T10:09:22.281374+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVFY5ZWTCZNE634S","created_at":"2026-07-05T10:09:22.281374+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVFY5ZWT","created_at":"2026-07-05T10:09:22.281374+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/DVFY5ZWTCZNE634ST54Y6O45DV","json":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV.json","graph_json":"https://pith.science/api/pith-number/DVFY5ZWTCZNE634ST54Y6O45DV/graph.json","events_json":"https://pith.science/api/pith-number/DVFY5ZWTCZNE634ST54Y6O45DV/events.json","paper":"https://pith.science/paper/DVFY5ZWT"},"agent_actions":{"view_html":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV","download_json":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV.json","view_paper":"https://pith.science/paper/DVFY5ZWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02010&json=true","fetch_graph":"https://pith.science/api/pith-number/DVFY5ZWTCZNE634ST54Y6O45DV/graph.json","fetch_events":"https://pith.science/api/pith-number/DVFY5ZWTCZNE634ST54Y6O45DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV/action/storage_attestation","attest_author":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV/action/author_attestation","sign_citation":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV/action/citation_signature","submit_replication":"https://pith.science/pith/DVFY5ZWTCZNE634ST54Y6O45DV/action/replication_record"}},"created_at":"2026-07-05T10:09:22.281374+00:00","updated_at":"2026-07-05T10:09:22.281374+00:00"}