{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:G7B4XAM2UCNLQXOCXB2W6UCH3A","short_pith_number":"pith:G7B4XAM2","schema_version":"1.0","canonical_sha256":"37c3cb819aa09ab85dc2b8756f5047d8046a32cdaf05a5c75607cc400c1f2d6f","source":{"kind":"arxiv","id":"2303.08785","version":2},"attestation_state":"computed","paper":{"title":"A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boris S. Mordukhovich, Dat Ba Tran, Pham Duy Khanh","submitted_at":"2023-03-15T17:27:21Z","abstract_excerpt":"The paper proposes and develops a novel inexact gradient method (IGD) for minimizing C1-smooth functions with Lipschitzian gradients, i.e., for problems of C1,1 optimization. We show that the sequence of gradients generated by IGD converges to zero. The convergence of iterates to stationary points is guaranteed under the Kurdyka- Lojasiewicz (KL) property of the objective function with convergence rates depending on the KL exponent. The newly developed IGD is applied to designing two novel gradient-based methods of nonsmooth convex optimization such as the inexact proximal point methods (GIPPM"},"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":"2303.08785","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-15T17:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"021a74aabe55086f0b381f69fbcb764f7133aaf8f5ae900e981c8ff0530b0dad","abstract_canon_sha256":"78a18eb9ff6bbb282dac0f325377f86a89993ccb079d6fbd4ae27e47a42a6207"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:42.418823Z","signature_b64":"/U/EGYVQiWjNcv3XkxaK+kMg4ZEXpXWOzn1qkYvH0P7Q/a7s/czNqZdE0vY85jNtx6cv+ltV8IMEUze7HQN2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c3cb819aa09ab85dc2b8756f5047d8046a32cdaf05a5c75607cc400c1f2d6f","last_reissued_at":"2026-07-05T07:32:42.418383Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:42.418383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boris S. Mordukhovich, Dat Ba Tran, Pham Duy Khanh","submitted_at":"2023-03-15T17:27:21Z","abstract_excerpt":"The paper proposes and develops a novel inexact gradient method (IGD) for minimizing C1-smooth functions with Lipschitzian gradients, i.e., for problems of C1,1 optimization. We show that the sequence of gradients generated by IGD converges to zero. The convergence of iterates to stationary points is guaranteed under the Kurdyka- Lojasiewicz (KL) property of the objective function with convergence rates depending on the KL exponent. The newly developed IGD is applied to designing two novel gradient-based methods of nonsmooth convex optimization such as the inexact proximal point methods (GIPPM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.08785","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/2303.08785/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":"2303.08785","created_at":"2026-07-05T07:32:42.418444+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.08785v2","created_at":"2026-07-05T07:32:42.418444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.08785","created_at":"2026-07-05T07:32:42.418444+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7B4XAM2UCNL","created_at":"2026-07-05T07:32:42.418444+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7B4XAM2UCNLQXOC","created_at":"2026-07-05T07:32:42.418444+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7B4XAM2","created_at":"2026-07-05T07:32:42.418444+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22997","citing_title":"Scene Reconstruction as Mapping Priors for 3D Detection","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A","json":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A.json","graph_json":"https://pith.science/api/pith-number/G7B4XAM2UCNLQXOCXB2W6UCH3A/graph.json","events_json":"https://pith.science/api/pith-number/G7B4XAM2UCNLQXOCXB2W6UCH3A/events.json","paper":"https://pith.science/paper/G7B4XAM2"},"agent_actions":{"view_html":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A","download_json":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A.json","view_paper":"https://pith.science/paper/G7B4XAM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.08785&json=true","fetch_graph":"https://pith.science/api/pith-number/G7B4XAM2UCNLQXOCXB2W6UCH3A/graph.json","fetch_events":"https://pith.science/api/pith-number/G7B4XAM2UCNLQXOCXB2W6UCH3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A/action/storage_attestation","attest_author":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A/action/author_attestation","sign_citation":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A/action/citation_signature","submit_replication":"https://pith.science/pith/G7B4XAM2UCNLQXOCXB2W6UCH3A/action/replication_record"}},"created_at":"2026-07-05T07:32:42.418444+00:00","updated_at":"2026-07-05T07:32:42.418444+00:00"}