{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NZI3H6H6R4XMTHQR3BRPJ5LTIX","short_pith_number":"pith:NZI3H6H6","schema_version":"1.0","canonical_sha256":"6e51b3f8fe8f2ec99e11d862f4f57345d09be7e384bf7afb881eaf85e1888612","source":{"kind":"arxiv","id":"2007.13545","version":1},"attestation_state":"computed","paper":{"title":"Tutorials on Advanced Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wei Wei","submitted_at":"2020-07-19T07:15:37Z","abstract_excerpt":"This material provides thorough tutorials on some optimization techniques frequently used in various engineering disciplines, including convex optimization, linearization techniques and mixed-integer linear programming, robust optimization, and equilibrium/game problems. It discusses how to reformulate a difficult (non-convex, multi-agent, min-max) problem to a solver-compatible form (semidefinite program, mixed-integer linear program) via convexification, linearization, and decomposition, so the original problem can be reliably solved by commercial/open-source software. Fundamental algorithms"},"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":"2007.13545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-19T07:15:37Z","cross_cats_sorted":[],"title_canon_sha256":"76c0bbd8a02a8fb1716e7cb44a4b6cc5a9fce37f460e635105f852c27a5c2003","abstract_canon_sha256":"e42adedd5323fa97cac377c171b738d00b8dbb11a5840009b7cfc2ace08441ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:25.292212Z","signature_b64":"h+RbSv/Hz22Epz0+YdinDrNKLz9MUjYQ8/r5Cnwdb/g+wslo81IAEXG31RlCqsM06b1nHYhPCWpgjQaCN9GWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e51b3f8fe8f2ec99e11d862f4f57345d09be7e384bf7afb881eaf85e1888612","last_reissued_at":"2026-07-05T01:22:25.291761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:25.291761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tutorials on Advanced Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wei Wei","submitted_at":"2020-07-19T07:15:37Z","abstract_excerpt":"This material provides thorough tutorials on some optimization techniques frequently used in various engineering disciplines, including convex optimization, linearization techniques and mixed-integer linear programming, robust optimization, and equilibrium/game problems. It discusses how to reformulate a difficult (non-convex, multi-agent, min-max) problem to a solver-compatible form (semidefinite program, mixed-integer linear program) via convexification, linearization, and decomposition, so the original problem can be reliably solved by commercial/open-source software. Fundamental algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.13545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.13545/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.13545","created_at":"2026-07-05T01:22:25.291832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.13545v1","created_at":"2026-07-05T01:22:25.291832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13545","created_at":"2026-07-05T01:22:25.291832+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZI3H6H6R4XM","created_at":"2026-07-05T01:22:25.291832+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZI3H6H6R4XMTHQR","created_at":"2026-07-05T01:22:25.291832+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZI3H6H6","created_at":"2026-07-05T01:22:25.291832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.02338","citing_title":"Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX","json":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX.json","graph_json":"https://pith.science/api/pith-number/NZI3H6H6R4XMTHQR3BRPJ5LTIX/graph.json","events_json":"https://pith.science/api/pith-number/NZI3H6H6R4XMTHQR3BRPJ5LTIX/events.json","paper":"https://pith.science/paper/NZI3H6H6"},"agent_actions":{"view_html":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX","download_json":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX.json","view_paper":"https://pith.science/paper/NZI3H6H6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.13545&json=true","fetch_graph":"https://pith.science/api/pith-number/NZI3H6H6R4XMTHQR3BRPJ5LTIX/graph.json","fetch_events":"https://pith.science/api/pith-number/NZI3H6H6R4XMTHQR3BRPJ5LTIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX/action/storage_attestation","attest_author":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX/action/author_attestation","sign_citation":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX/action/citation_signature","submit_replication":"https://pith.science/pith/NZI3H6H6R4XMTHQR3BRPJ5LTIX/action/replication_record"}},"created_at":"2026-07-05T01:22:25.291832+00:00","updated_at":"2026-07-05T01:22:25.291832+00:00"}