{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HFQLRFFLFSGG7P4HWEQWH2WSMY","short_pith_number":"pith:HFQLRFFL","schema_version":"1.0","canonical_sha256":"3960b894ab2c8c6fbf87b12163ead26627fb7ae3e0de783cca630f4353faeb90","source":{"kind":"arxiv","id":"1611.09260","version":2},"attestation_state":"computed","paper":{"title":"The LP-Newton Method and Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Silvestri, Gerhard Reinelt","submitted_at":"2016-11-28T17:50:41Z","abstract_excerpt":"We propose that the LP-Newton method can be used to solve conic LPs over a conic box, whenever linear optimization over an otherwise unconstrained conic box is easy. In particular, if $\\leq_\\mathcal{K}$ is the partial order induced by a proper convex cone $\\mathcal{K}$, then optimizing a linear function over the intersection of $[{l},{u}]_\\mathcal{K}=\\{{l}\\leq_\\mathcal{K} {x}\\leq_\\mathcal{K}{u}\\}$ and an affine subspace can be done with this method whenever optimizing a linear function over $[{l},{u}]_{\\mathcal{K}}$ is efficient.\n  This generalizes the result for the case of $\\mathcal{K}=\\math"},"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":"1611.09260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-28T17:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"51ebd282f8b720b455eb87aae6f124fcf1c51bba336a12fafc6fc1c773b118e4","abstract_canon_sha256":"93572df48646511addbfd4e0e2d620281bb69904effe2a3b07cff93a8b3046d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:03.894653Z","signature_b64":"NjQy+zZbQ/nzNP9pwiJvw4VivpWD1hZ+2uAJ54IM9hNXAxwhBY48fgoVE+lyyelxdZIdN/84jaSwbED+xm5HDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3960b894ab2c8c6fbf87b12163ead26627fb7ae3e0de783cca630f4353faeb90","last_reissued_at":"2026-05-18T00:38:03.893977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:03.893977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The LP-Newton Method and Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Silvestri, Gerhard Reinelt","submitted_at":"2016-11-28T17:50:41Z","abstract_excerpt":"We propose that the LP-Newton method can be used to solve conic LPs over a conic box, whenever linear optimization over an otherwise unconstrained conic box is easy. In particular, if $\\leq_\\mathcal{K}$ is the partial order induced by a proper convex cone $\\mathcal{K}$, then optimizing a linear function over the intersection of $[{l},{u}]_\\mathcal{K}=\\{{l}\\leq_\\mathcal{K} {x}\\leq_\\mathcal{K}{u}\\}$ and an affine subspace can be done with this method whenever optimizing a linear function over $[{l},{u}]_{\\mathcal{K}}$ is efficient.\n  This generalizes the result for the case of $\\mathcal{K}=\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09260","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":"1611.09260","created_at":"2026-05-18T00:38:03.894068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09260v2","created_at":"2026-05-18T00:38:03.894068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09260","created_at":"2026-05-18T00:38:03.894068+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFQLRFFLFSGG","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFQLRFFLFSGG7P4H","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFQLRFFL","created_at":"2026-05-18T12:30:19.053100+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/HFQLRFFLFSGG7P4HWEQWH2WSMY","json":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY.json","graph_json":"https://pith.science/api/pith-number/HFQLRFFLFSGG7P4HWEQWH2WSMY/graph.json","events_json":"https://pith.science/api/pith-number/HFQLRFFLFSGG7P4HWEQWH2WSMY/events.json","paper":"https://pith.science/paper/HFQLRFFL"},"agent_actions":{"view_html":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY","download_json":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY.json","view_paper":"https://pith.science/paper/HFQLRFFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09260&json=true","fetch_graph":"https://pith.science/api/pith-number/HFQLRFFLFSGG7P4HWEQWH2WSMY/graph.json","fetch_events":"https://pith.science/api/pith-number/HFQLRFFLFSGG7P4HWEQWH2WSMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY/action/storage_attestation","attest_author":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY/action/author_attestation","sign_citation":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY/action/citation_signature","submit_replication":"https://pith.science/pith/HFQLRFFLFSGG7P4HWEQWH2WSMY/action/replication_record"}},"created_at":"2026-05-18T00:38:03.894068+00:00","updated_at":"2026-05-18T00:38:03.894068+00:00"}