{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PYQLPU2GVTD6LZ457R2GHLWGBE","short_pith_number":"pith:PYQLPU2G","schema_version":"1.0","canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","source":{"kind":"arxiv","id":"1905.01893","version":1},"attestation_state":"computed","paper":{"title":"A comparison of first-order methods for the numerical solution of or-constrained optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Patrick Mehlitz","submitted_at":"2019-05-06T09:19:22Z","abstract_excerpt":"Mathematical programs with or-constraints form a new class of disjunctive optimization problems with inherent practical relevance. In this paper, we provide a comparison of three different first-order methods for the numerical treatment of this problem class which are inspired by classical approaches from disjunctive programming. First, we study the replacement of the or-constraints as nonlinear inequality constraints using suitable NCP-functions. Second, we transfer the or-constrained program into a mathematical program with switching or complementarity constraints which can be treated with t"},"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":"1905.01893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-06T09:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"8027c51c1eda0c793e6eedc4974580af4ba64594da37a5f99d61867a21bed994","abstract_canon_sha256":"7dcbc9ddb03021b33388138202bb3cf1694f0d90dd28b84c3b6ae824fa225c18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.073761Z","signature_b64":"rLi7AnaYaIBdeBsHnC8ukdqxXJklfLNkdiVDYYLJHUrIL8G7YEORFxuMdj1EpgKvv58jqUGjuZpvLAug531qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e20b7d346acc7e5e79dfc7463aec6091255adb1f0c1a42c3a280d1169c26fb5","last_reissued_at":"2026-05-17T23:46:57.072995Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.072995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A comparison of first-order methods for the numerical solution of or-constrained optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Patrick Mehlitz","submitted_at":"2019-05-06T09:19:22Z","abstract_excerpt":"Mathematical programs with or-constraints form a new class of disjunctive optimization problems with inherent practical relevance. In this paper, we provide a comparison of three different first-order methods for the numerical treatment of this problem class which are inspired by classical approaches from disjunctive programming. First, we study the replacement of the or-constraints as nonlinear inequality constraints using suitable NCP-functions. Second, we transfer the or-constrained program into a mathematical program with switching or complementarity constraints which can be treated with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01893","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":"1905.01893","created_at":"2026-05-17T23:46:57.073135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01893v1","created_at":"2026-05-17T23:46:57.073135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01893","created_at":"2026-05-17T23:46:57.073135+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYQLPU2GVTD6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYQLPU2GVTD6LZ45","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYQLPU2G","created_at":"2026-05-18T12:33:24.271573+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/PYQLPU2GVTD6LZ457R2GHLWGBE","json":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE.json","graph_json":"https://pith.science/api/pith-number/PYQLPU2GVTD6LZ457R2GHLWGBE/graph.json","events_json":"https://pith.science/api/pith-number/PYQLPU2GVTD6LZ457R2GHLWGBE/events.json","paper":"https://pith.science/paper/PYQLPU2G"},"agent_actions":{"view_html":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE","download_json":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE.json","view_paper":"https://pith.science/paper/PYQLPU2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01893&json=true","fetch_graph":"https://pith.science/api/pith-number/PYQLPU2GVTD6LZ457R2GHLWGBE/graph.json","fetch_events":"https://pith.science/api/pith-number/PYQLPU2GVTD6LZ457R2GHLWGBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/action/storage_attestation","attest_author":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/action/author_attestation","sign_citation":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/action/citation_signature","submit_replication":"https://pith.science/pith/PYQLPU2GVTD6LZ457R2GHLWGBE/action/replication_record"}},"created_at":"2026-05-17T23:46:57.073135+00:00","updated_at":"2026-05-17T23:46:57.073135+00:00"}