{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BHK3WETJX442PRM5NCGC4ZMRX5","short_pith_number":"pith:BHK3WETJ","schema_version":"1.0","canonical_sha256":"09d5bb1269bf39a7c59d688c2e6591bf75659f12d55c9cf0d5abce9298032479","source":{"kind":"arxiv","id":"2106.14359","version":1},"attestation_state":"computed","paper":{"title":"Zeroth-order optimisation on subsets of symmetric matrices with application to MPC tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro I. Maass, Chris Manzie, Hayato Nakada, Iman Shames","submitted_at":"2021-06-28T01:05:29Z","abstract_excerpt":"This paper provides a zeroth-order optimisation framework for non-smooth and possibly non-convex cost functions with matrix parameters that are real and symmetric. We provide complexity bounds on the number of iterations required to ensure a given accuracy level for both the convex and non-convex case. The derived complexity bounds for the convex case are less conservative than available bounds in the literature since we exploit the symmetric structure of the underlying matrix space. Moreover, the non-convex complexity bounds are novel for the class of optimisation problems we consider. The ut"},"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":"2106.14359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-28T01:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"ae8f1fb81c44f700575c6be73c065726fee9c3cc5446dc85665b3714446971af","abstract_canon_sha256":"da5f093cbcfb4878174040e7a0c07a90da095c30081ff9ca40fe54f1c4333a54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:49.859172Z","signature_b64":"YKLHSgrAuO83zJgfvL2jArcp2qjOgF9aSv4ghZbV/qyZO2sv5y9H1o3zfyJ992QnB9Wj/9yLjkZ+WKIHUvcrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d5bb1269bf39a7c59d688c2e6591bf75659f12d55c9cf0d5abce9298032479","last_reissued_at":"2026-07-05T02:52:49.858768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:49.858768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zeroth-order optimisation on subsets of symmetric matrices with application to MPC tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro I. Maass, Chris Manzie, Hayato Nakada, Iman Shames","submitted_at":"2021-06-28T01:05:29Z","abstract_excerpt":"This paper provides a zeroth-order optimisation framework for non-smooth and possibly non-convex cost functions with matrix parameters that are real and symmetric. We provide complexity bounds on the number of iterations required to ensure a given accuracy level for both the convex and non-convex case. The derived complexity bounds for the convex case are less conservative than available bounds in the literature since we exploit the symmetric structure of the underlying matrix space. Moreover, the non-convex complexity bounds are novel for the class of optimisation problems we consider. The ut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14359","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/2106.14359/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":"2106.14359","created_at":"2026-07-05T02:52:49.858827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.14359v1","created_at":"2026-07-05T02:52:49.858827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14359","created_at":"2026-07-05T02:52:49.858827+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHK3WETJX442","created_at":"2026-07-05T02:52:49.858827+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHK3WETJX442PRM5","created_at":"2026-07-05T02:52:49.858827+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHK3WETJ","created_at":"2026-07-05T02:52:49.858827+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/BHK3WETJX442PRM5NCGC4ZMRX5","json":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5.json","graph_json":"https://pith.science/api/pith-number/BHK3WETJX442PRM5NCGC4ZMRX5/graph.json","events_json":"https://pith.science/api/pith-number/BHK3WETJX442PRM5NCGC4ZMRX5/events.json","paper":"https://pith.science/paper/BHK3WETJ"},"agent_actions":{"view_html":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5","download_json":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5.json","view_paper":"https://pith.science/paper/BHK3WETJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.14359&json=true","fetch_graph":"https://pith.science/api/pith-number/BHK3WETJX442PRM5NCGC4ZMRX5/graph.json","fetch_events":"https://pith.science/api/pith-number/BHK3WETJX442PRM5NCGC4ZMRX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5/action/storage_attestation","attest_author":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5/action/author_attestation","sign_citation":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5/action/citation_signature","submit_replication":"https://pith.science/pith/BHK3WETJX442PRM5NCGC4ZMRX5/action/replication_record"}},"created_at":"2026-07-05T02:52:49.858827+00:00","updated_at":"2026-07-05T02:52:49.858827+00:00"}