{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PSEYSTRVW4XQCALC373GK22REG","short_pith_number":"pith:PSEYSTRV","schema_version":"1.0","canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","source":{"kind":"arxiv","id":"1411.2129","version":1},"attestation_state":"computed","paper":{"title":"Interior-point algorithms for convex optimization based on primal-dual metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tun\\c{c}el, Tor Myklebust","submitted_at":"2014-11-08T15:37:48Z","abstract_excerpt":"We propose and analyse primal-dual interior-point algorithms for convex optimization problems in conic form. The families of algorithms we analyse are so-called short-step algorithms and they match the current best iteration complexity bounds for primal-dual symmetric interior-point algorithm of Nesterov and Todd, for symmetric cone programming problems with given self-scaled barriers. Our results apply to any self-concordant barrier for any convex cone. We also prove that certain specializations of our algorithms to hyperbolic cone programming problems (which lie strictly between symmetric co"},"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.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-08T15:37:48Z","cross_cats_sorted":[],"title_canon_sha256":"ae0e5290b4de590910e2d02f7d48caa9226775e2ad02d021db63eca6dc0168dd","abstract_canon_sha256":"69c5014811d46155e59301b25d4a6e8af826ea76de207878eaa7cdb12b5caf6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:08.548709Z","signature_b64":"aFnq4/QjQFdJPI5lVzuRf0IQR+2KEsYjSYqRllJwI891LSUR+FEMop+XgJDsbcLKPk5PzC2yKX4W4qjT8OXRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","last_reissued_at":"2026-05-18T02:38:08.548073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:08.548073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interior-point algorithms for convex optimization based on primal-dual metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tun\\c{c}el, Tor Myklebust","submitted_at":"2014-11-08T15:37:48Z","abstract_excerpt":"We propose and analyse primal-dual interior-point algorithms for convex optimization problems in conic form. The families of algorithms we analyse are so-called short-step algorithms and they match the current best iteration complexity bounds for primal-dual symmetric interior-point algorithm of Nesterov and Todd, for symmetric cone programming problems with given self-scaled barriers. Our results apply to any self-concordant barrier for any convex cone. We also prove that certain specializations of our algorithms to hyperbolic cone programming problems (which lie strictly between symmetric co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2129","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":"1411.2129","created_at":"2026-05-18T02:38:08.548166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2129v1","created_at":"2026-05-18T02:38:08.548166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2129","created_at":"2026-05-18T02:38:08.548166+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSEYSTRVW4XQ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSEYSTRVW4XQCALC","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSEYSTRV","created_at":"2026-05-18T12:28:43.426989+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/PSEYSTRVW4XQCALC373GK22REG","json":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG.json","graph_json":"https://pith.science/api/pith-number/PSEYSTRVW4XQCALC373GK22REG/graph.json","events_json":"https://pith.science/api/pith-number/PSEYSTRVW4XQCALC373GK22REG/events.json","paper":"https://pith.science/paper/PSEYSTRV"},"agent_actions":{"view_html":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG","download_json":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG.json","view_paper":"https://pith.science/paper/PSEYSTRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2129&json=true","fetch_graph":"https://pith.science/api/pith-number/PSEYSTRVW4XQCALC373GK22REG/graph.json","fetch_events":"https://pith.science/api/pith-number/PSEYSTRVW4XQCALC373GK22REG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/action/storage_attestation","attest_author":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/action/author_attestation","sign_citation":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/action/citation_signature","submit_replication":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/action/replication_record"}},"created_at":"2026-05-18T02:38:08.548166+00:00","updated_at":"2026-05-18T02:38:08.548166+00:00"}