{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:735RYXLTIDKROT4ME3YLAK7MFD","short_pith_number":"pith:735RYXLT","schema_version":"1.0","canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","source":{"kind":"arxiv","id":"2312.01334","version":3},"attestation_state":"computed","paper":{"title":"Optimization Methods Rooting in Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongxia Wang, Huanshui Zhang","submitted_at":"2023-12-03T09:50:42Z","abstract_excerpt":"In the paper, we propose solving optimization problems (OPs) and understanding the Newton method from the optimal control view. We propose a new optimization algorithm based on the optimal control problem (OCP). The algorithm features converging more rapidly than gradient descent, meanwhile, it is superior to Newton's method because it is not divergent in general and can be applied in the case of a singular Hessian matrix. These merits are supported by the convergence analysis for the algorithm in the paper. We also point out that the convergence rate of the proposed algorithm is inversely pro"},"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.01334","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-03T09:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"3c8f7c687a79d8b2ac355412c2ed1984e543b4eb327223ad8fb0fa6cdf255851","abstract_canon_sha256":"0eab71342b709f006f9ded5c320212a49d3e0f8ab9ecc06d6fa269b089aaaab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:44.870477Z","signature_b64":"U3NvXtDKzkoTeTw2V7s5R63qMbMHf52kcgamhirP60mJzENPr06fheUJy1TsbP7rvYYhKcA0rvLZMxhqdX9uCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefb1c5d7340d5174f8c26f0b02bec28d58bfe767b3575e9c5261340743f0369","last_reissued_at":"2026-07-05T10:41:44.870021Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:44.870021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization Methods Rooting in Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongxia Wang, Huanshui Zhang","submitted_at":"2023-12-03T09:50:42Z","abstract_excerpt":"In the paper, we propose solving optimization problems (OPs) and understanding the Newton method from the optimal control view. We propose a new optimization algorithm based on the optimal control problem (OCP). The algorithm features converging more rapidly than gradient descent, meanwhile, it is superior to Newton's method because it is not divergent in general and can be applied in the case of a singular Hessian matrix. These merits are supported by the convergence analysis for the algorithm in the paper. We also point out that the convergence rate of the proposed algorithm is inversely pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01334","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.01334/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.01334","created_at":"2026-07-05T10:41:44.870076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.01334v3","created_at":"2026-07-05T10:41:44.870076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01334","created_at":"2026-07-05T10:41:44.870076+00:00"},{"alias_kind":"pith_short_12","alias_value":"735RYXLTIDKR","created_at":"2026-07-05T10:41:44.870076+00:00"},{"alias_kind":"pith_short_16","alias_value":"735RYXLTIDKROT4M","created_at":"2026-07-05T10:41:44.870076+00:00"},{"alias_kind":"pith_short_8","alias_value":"735RYXLT","created_at":"2026-07-05T10:41:44.870076+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10658","citing_title":"Distributed Optimization Method Based On Optimal Control","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD","json":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD.json","graph_json":"https://pith.science/api/pith-number/735RYXLTIDKROT4ME3YLAK7MFD/graph.json","events_json":"https://pith.science/api/pith-number/735RYXLTIDKROT4ME3YLAK7MFD/events.json","paper":"https://pith.science/paper/735RYXLT"},"agent_actions":{"view_html":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD","download_json":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD.json","view_paper":"https://pith.science/paper/735RYXLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.01334&json=true","fetch_graph":"https://pith.science/api/pith-number/735RYXLTIDKROT4ME3YLAK7MFD/graph.json","fetch_events":"https://pith.science/api/pith-number/735RYXLTIDKROT4ME3YLAK7MFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/action/storage_attestation","attest_author":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/action/author_attestation","sign_citation":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/action/citation_signature","submit_replication":"https://pith.science/pith/735RYXLTIDKROT4ME3YLAK7MFD/action/replication_record"}},"created_at":"2026-07-05T10:41:44.870076+00:00","updated_at":"2026-07-05T10:41:44.870076+00:00"}