{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XEF2SIINLIW75B25DSONGHMTWA","short_pith_number":"pith:XEF2SIIN","schema_version":"1.0","canonical_sha256":"b90ba9210d5a2dfe875d1c9cd31d93b02751a342886b4a016e349c2fadc38698","source":{"kind":"arxiv","id":"2501.04536","version":1},"attestation_state":"computed","paper":{"title":"Scalable Derivative-Free Optimization Algorithms with Low-Dimensional Subspace Techniques","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zaikun Zhang","submitted_at":"2025-01-08T14:36:22Z","abstract_excerpt":"We re-introduce a derivative-free subspace optimization framework originating from Chapter 5 of the Ph.D. thesis [Z. Zhang, On Derivative-Free Optimization Methods, Ph.D. thesis, Chinese Academy of Sciences, Beijing, 2012] of the author under the supervision of Ya-xiang Yuan. At each iteration, the framework defines a (low-dimensional) subspace based on an approximate gradient, and then solves a subproblem in this subspace to generate a new iterate. We sketch the global convergence and worst-case complexity analysis of the framework, elaborate on its implementation, and present some numerical "},"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":"2501.04536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-08T14:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"081918c8b7eb30dc562884cbffe5334dab789f4c43e56d456eb70b7edfd3ca6a","abstract_canon_sha256":"66f10f14d8c9b1080e7db8c0341b9a9515c70cec6bdfe05fc9e6680a67ccd40b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:36.982705Z","signature_b64":"WvsEX+diHvfEFBiOd9f4Gr285GG4B93YFMzZCteAZNSn8MT8uim/oCIzmtrqSfvRiAh8Mt8UtAchiPAzrib/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b90ba9210d5a2dfe875d1c9cd31d93b02751a342886b4a016e349c2fadc38698","last_reissued_at":"2026-07-05T09:58:36.982282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:36.982282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Derivative-Free Optimization Algorithms with Low-Dimensional Subspace Techniques","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zaikun Zhang","submitted_at":"2025-01-08T14:36:22Z","abstract_excerpt":"We re-introduce a derivative-free subspace optimization framework originating from Chapter 5 of the Ph.D. thesis [Z. Zhang, On Derivative-Free Optimization Methods, Ph.D. thesis, Chinese Academy of Sciences, Beijing, 2012] of the author under the supervision of Ya-xiang Yuan. At each iteration, the framework defines a (low-dimensional) subspace based on an approximate gradient, and then solves a subproblem in this subspace to generate a new iterate. We sketch the global convergence and worst-case complexity analysis of the framework, elaborate on its implementation, and present some numerical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04536","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/2501.04536/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":"2501.04536","created_at":"2026-07-05T09:58:36.982340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04536v1","created_at":"2026-07-05T09:58:36.982340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04536","created_at":"2026-07-05T09:58:36.982340+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEF2SIINLIW7","created_at":"2026-07-05T09:58:36.982340+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEF2SIINLIW75B25","created_at":"2026-07-05T09:58:36.982340+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEF2SIIN","created_at":"2026-07-05T09:58:36.982340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30841","citing_title":"BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA","json":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA.json","graph_json":"https://pith.science/api/pith-number/XEF2SIINLIW75B25DSONGHMTWA/graph.json","events_json":"https://pith.science/api/pith-number/XEF2SIINLIW75B25DSONGHMTWA/events.json","paper":"https://pith.science/paper/XEF2SIIN"},"agent_actions":{"view_html":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA","download_json":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA.json","view_paper":"https://pith.science/paper/XEF2SIIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04536&json=true","fetch_graph":"https://pith.science/api/pith-number/XEF2SIINLIW75B25DSONGHMTWA/graph.json","fetch_events":"https://pith.science/api/pith-number/XEF2SIINLIW75B25DSONGHMTWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA/action/storage_attestation","attest_author":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA/action/author_attestation","sign_citation":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA/action/citation_signature","submit_replication":"https://pith.science/pith/XEF2SIINLIW75B25DSONGHMTWA/action/replication_record"}},"created_at":"2026-07-05T09:58:36.982340+00:00","updated_at":"2026-07-05T09:58:36.982340+00:00"}