{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ABYUDD3FPENDSYR5AMB32T5MSI","short_pith_number":"pith:ABYUDD3F","schema_version":"1.0","canonical_sha256":"0071418f65791a39623d0303bd4fac921d0f3c2e284c5d3e6ba290919d2306b4","source":{"kind":"arxiv","id":"1307.5151","version":1},"attestation_state":"computed","paper":{"title":"SDP Duals without Duality Gaps for a Class of Convex Minimax Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Vicente-Perez, V. Jeyakumar","submitted_at":"2013-07-19T08:00:00Z","abstract_excerpt":"In this paper we introduce a new dual program, which is representable as a semi-definite linear programming problem, for a primal convex minimax programming model problem and show that there is no duality gap between the primal and the dual whenever the functions involved are SOS-convex polynomials. Under a suitable constraint qualification, we derive strong duality results for this class of minimax problems. Consequently, we present applications of our results to robust SOS-convex programming problems under data uncertainty and to minimax fractional programming problems with SOS-convex polyno"},"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":"1307.5151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-19T08:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"19be3d08ee909518e46c59eeef9cfd2e106f2963a3e4597fcc1ff1bf642ef3fb","abstract_canon_sha256":"7ab7eaf4515027bb6109646fc2630b0b58cfb9a53923b1baa38ef43a7d8e72b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:09.686241Z","signature_b64":"0SM1KDn5uow9jlHVcGGxDYTdwdD0YogZ638UPvOh4C6i0L6c5pmtXxjoW8ng8bKGdiv2iZ9ODzVvaGTigvvbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0071418f65791a39623d0303bd4fac921d0f3c2e284c5d3e6ba290919d2306b4","last_reissued_at":"2026-05-18T03:05:09.685600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:09.685600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SDP Duals without Duality Gaps for a Class of Convex Minimax Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Vicente-Perez, V. Jeyakumar","submitted_at":"2013-07-19T08:00:00Z","abstract_excerpt":"In this paper we introduce a new dual program, which is representable as a semi-definite linear programming problem, for a primal convex minimax programming model problem and show that there is no duality gap between the primal and the dual whenever the functions involved are SOS-convex polynomials. Under a suitable constraint qualification, we derive strong duality results for this class of minimax problems. Consequently, we present applications of our results to robust SOS-convex programming problems under data uncertainty and to minimax fractional programming problems with SOS-convex polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5151","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":"1307.5151","created_at":"2026-05-18T03:05:09.685707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5151v1","created_at":"2026-05-18T03:05:09.685707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5151","created_at":"2026-05-18T03:05:09.685707+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABYUDD3FPEND","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABYUDD3FPENDSYR5","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABYUDD3F","created_at":"2026-05-18T12:27:38.830355+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/ABYUDD3FPENDSYR5AMB32T5MSI","json":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI.json","graph_json":"https://pith.science/api/pith-number/ABYUDD3FPENDSYR5AMB32T5MSI/graph.json","events_json":"https://pith.science/api/pith-number/ABYUDD3FPENDSYR5AMB32T5MSI/events.json","paper":"https://pith.science/paper/ABYUDD3F"},"agent_actions":{"view_html":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI","download_json":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI.json","view_paper":"https://pith.science/paper/ABYUDD3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5151&json=true","fetch_graph":"https://pith.science/api/pith-number/ABYUDD3FPENDSYR5AMB32T5MSI/graph.json","fetch_events":"https://pith.science/api/pith-number/ABYUDD3FPENDSYR5AMB32T5MSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI/action/storage_attestation","attest_author":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI/action/author_attestation","sign_citation":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI/action/citation_signature","submit_replication":"https://pith.science/pith/ABYUDD3FPENDSYR5AMB32T5MSI/action/replication_record"}},"created_at":"2026-05-18T03:05:09.685707+00:00","updated_at":"2026-05-18T03:05:09.685707+00:00"}