{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KRGZWELH7YODTV4JVF3EASITLO","short_pith_number":"pith:KRGZWELH","schema_version":"1.0","canonical_sha256":"544d9b1167fe1c39d789a9764049135bafac4807943e17a7b95191ad31b0dfaf","source":{"kind":"arxiv","id":"1411.4339","version":2},"attestation_state":"computed","paper":{"title":"An iterative method using boundary distance for box-constrained nonlinear semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akihiko Komatsu, Makoto Yamashita","submitted_at":"2014-11-17T01:23:58Z","abstract_excerpt":"We propose an iterative method for nonlinear semidefinite programs with box constraints. The search direction in the proposed method utilizes the distance from the current point to the boundary of a feasible set. The computation of the search direction exploits the second derivative of the objective function only in a quadratic form, and this property saves the computation cost compared to an evaluation of the whole entries of the second derivative. We compute a step length in an interval determined by a radius and we update the radius using a quadratic approximation function. In this paper, w"},"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":"1411.4339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-17T01:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"a90e2262646d25947cbb9a3b4ca4af8e93e2ebb3e8255acd223f1a66782aae0f","abstract_canon_sha256":"860f57c6c2f20d5b2b12204d9e9a45cc88a43475a581eea18e2110d40cf2c4d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:54.415665Z","signature_b64":"BvRFG5DBOR8E8aWEDJ3qFPY028W3varTsGHvhWOsqmuugglVv4NYVNzOP4lNxWfn8SMBvIRRQYJqXj7YJ6/BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"544d9b1167fe1c39d789a9764049135bafac4807943e17a7b95191ad31b0dfaf","last_reissued_at":"2026-05-18T02:09:54.414770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:54.414770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An iterative method using boundary distance for box-constrained nonlinear semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akihiko Komatsu, Makoto Yamashita","submitted_at":"2014-11-17T01:23:58Z","abstract_excerpt":"We propose an iterative method for nonlinear semidefinite programs with box constraints. The search direction in the proposed method utilizes the distance from the current point to the boundary of a feasible set. The computation of the search direction exploits the second derivative of the objective function only in a quadratic form, and this property saves the computation cost compared to an evaluation of the whole entries of the second derivative. We compute a step length in an interval determined by a radius and we update the radius using a quadratic approximation function. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4339","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":""},"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":"1411.4339","created_at":"2026-05-18T02:09:54.414908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4339v2","created_at":"2026-05-18T02:09:54.414908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4339","created_at":"2026-05-18T02:09:54.414908+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRGZWELH7YOD","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRGZWELH7YODTV4J","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRGZWELH","created_at":"2026-05-18T12:28:35.611951+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/KRGZWELH7YODTV4JVF3EASITLO","json":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO.json","graph_json":"https://pith.science/api/pith-number/KRGZWELH7YODTV4JVF3EASITLO/graph.json","events_json":"https://pith.science/api/pith-number/KRGZWELH7YODTV4JVF3EASITLO/events.json","paper":"https://pith.science/paper/KRGZWELH"},"agent_actions":{"view_html":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO","download_json":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO.json","view_paper":"https://pith.science/paper/KRGZWELH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4339&json=true","fetch_graph":"https://pith.science/api/pith-number/KRGZWELH7YODTV4JVF3EASITLO/graph.json","fetch_events":"https://pith.science/api/pith-number/KRGZWELH7YODTV4JVF3EASITLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO/action/storage_attestation","attest_author":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO/action/author_attestation","sign_citation":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO/action/citation_signature","submit_replication":"https://pith.science/pith/KRGZWELH7YODTV4JVF3EASITLO/action/replication_record"}},"created_at":"2026-05-18T02:09:54.414908+00:00","updated_at":"2026-05-18T02:09:54.414908+00:00"}