{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:G7AUIOCE7IPVAFSOLPRJN7Q35W","short_pith_number":"pith:G7AUIOCE","schema_version":"1.0","canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","source":{"kind":"arxiv","id":"1007.2371","version":1},"attestation_state":"computed","paper":{"title":"MM Algorithms for Geometric and Signomial Programming","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC","stat.CO"],"primary_cat":"math.NA","authors_text":"Hua Zhou, Kenneth Lange","submitted_at":"2010-07-14T16:30:00Z","abstract_excerpt":"This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimu"},"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":"1007.2371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2010-07-14T16:30:00Z","cross_cats_sorted":["math.OC","stat.CO"],"title_canon_sha256":"4c49ba4de633c14a5fff1a37ad5fc57234b2520fbaf5f663558106e99acaa935","abstract_canon_sha256":"c6777b59c192677a73b8bfb8af8fc2977efba711a7f51e2c3cb2afffd8b31e78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:00.840124Z","signature_b64":"xjn2mWqsIuk2H4VPPPHCN9LAuAFmTmCJ6PyWz4E2RI7yAdHafsJfvDiKpxsPOplQwJr/Otrp8fZZEE7+SeU4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","last_reissued_at":"2026-05-18T03:10:00.839669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:00.839669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MM Algorithms for Geometric and Signomial Programming","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC","stat.CO"],"primary_cat":"math.NA","authors_text":"Hua Zhou, Kenneth Lange","submitted_at":"2010-07-14T16:30:00Z","abstract_excerpt":"This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2371","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":"1007.2371","created_at":"2026-05-18T03:10:00.839738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2371v1","created_at":"2026-05-18T03:10:00.839738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2371","created_at":"2026-05-18T03:10:00.839738+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7AUIOCE7IPV","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7AUIOCE7IPVAFSO","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7AUIOCE","created_at":"2026-05-18T12:26:07.630475+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/G7AUIOCE7IPVAFSOLPRJN7Q35W","json":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W.json","graph_json":"https://pith.science/api/pith-number/G7AUIOCE7IPVAFSOLPRJN7Q35W/graph.json","events_json":"https://pith.science/api/pith-number/G7AUIOCE7IPVAFSOLPRJN7Q35W/events.json","paper":"https://pith.science/paper/G7AUIOCE"},"agent_actions":{"view_html":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W","download_json":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W.json","view_paper":"https://pith.science/paper/G7AUIOCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2371&json=true","fetch_graph":"https://pith.science/api/pith-number/G7AUIOCE7IPVAFSOLPRJN7Q35W/graph.json","fetch_events":"https://pith.science/api/pith-number/G7AUIOCE7IPVAFSOLPRJN7Q35W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/action/storage_attestation","attest_author":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/action/author_attestation","sign_citation":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/action/citation_signature","submit_replication":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/action/replication_record"}},"created_at":"2026-05-18T03:10:00.839738+00:00","updated_at":"2026-05-18T03:10:00.839738+00:00"}