{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H4IV7ZQBSUEJXYQL3AEIR263EJ","short_pith_number":"pith:H4IV7ZQB","schema_version":"1.0","canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","source":{"kind":"arxiv","id":"1810.00353","version":1},"attestation_state":"computed","paper":{"title":"Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masao Fukushima, Takayuki Okuno","submitted_at":"2018-09-30T10:36:10Z","abstract_excerpt":"In this paper, we propose two algorithms for nonlinear semi-infinite semi-definite programs with infinitely many convex inequality constraints, called SISDP for short. A straightforward approach to the SISDP is to use classical methods for semi-infinite programs such as discretization and exchange methods and solve a sequence of (nonlinear) semi-definite programs (SDPs). However, it is often too demanding to find exact solutions of SDPs.\n  Our first approach does not rely on solving SDPs but on approximately following {a path leading to a solution, which is formed on the intersection of the se"},"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":"1810.00353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-30T10:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"372d29210a839c31caa4fab0b99da7075dbc54c0470ebe1b8c85eb57f37b74e8","abstract_canon_sha256":"e3e7ae9d54ddfbac7fb2bd053b4fabf28f8159b7d2f9dc2d5620cee683853361"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:28.092614Z","signature_b64":"QF4cAxJqVrceo8VNDJPHxw3EWwa2EvYi7KJr8OUcizBmbGTpuql1dCQNNqkSv39x0fcilk0eS7kP045heFwKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f115fe60195089be20bd80888ebdb224023394fd7eb76fc7433ba897c820f72","last_reissued_at":"2026-05-18T00:04:28.092175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:28.092175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masao Fukushima, Takayuki Okuno","submitted_at":"2018-09-30T10:36:10Z","abstract_excerpt":"In this paper, we propose two algorithms for nonlinear semi-infinite semi-definite programs with infinitely many convex inequality constraints, called SISDP for short. A straightforward approach to the SISDP is to use classical methods for semi-infinite programs such as discretization and exchange methods and solve a sequence of (nonlinear) semi-definite programs (SDPs). However, it is often too demanding to find exact solutions of SDPs.\n  Our first approach does not rely on solving SDPs but on approximately following {a path leading to a solution, which is formed on the intersection of the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00353","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":""},"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":"1810.00353","created_at":"2026-05-18T00:04:28.092243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00353v1","created_at":"2026-05-18T00:04:28.092243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00353","created_at":"2026-05-18T00:04:28.092243+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4IV7ZQBSUEJ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4IV7ZQBSUEJXYQL","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4IV7ZQB","created_at":"2026-05-18T12:32:28.185984+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/H4IV7ZQBSUEJXYQL3AEIR263EJ","json":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ.json","graph_json":"https://pith.science/api/pith-number/H4IV7ZQBSUEJXYQL3AEIR263EJ/graph.json","events_json":"https://pith.science/api/pith-number/H4IV7ZQBSUEJXYQL3AEIR263EJ/events.json","paper":"https://pith.science/paper/H4IV7ZQB"},"agent_actions":{"view_html":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ","download_json":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ.json","view_paper":"https://pith.science/paper/H4IV7ZQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00353&json=true","fetch_graph":"https://pith.science/api/pith-number/H4IV7ZQBSUEJXYQL3AEIR263EJ/graph.json","fetch_events":"https://pith.science/api/pith-number/H4IV7ZQBSUEJXYQL3AEIR263EJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/action/storage_attestation","attest_author":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/action/author_attestation","sign_citation":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/action/citation_signature","submit_replication":"https://pith.science/pith/H4IV7ZQBSUEJXYQL3AEIR263EJ/action/replication_record"}},"created_at":"2026-05-18T00:04:28.092243+00:00","updated_at":"2026-05-18T00:04:28.092243+00:00"}