{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LHIHPU533QHJ4UVAM23BLCY65K","short_pith_number":"pith:LHIHPU53","schema_version":"1.0","canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","source":{"kind":"arxiv","id":"1306.6419","version":1},"attestation_state":"computed","paper":{"title":"Convergence of the Lasserre Hierarchy of SDP Relaxations for Convex Polynomial Programs without Compactness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, T. S. Pham, V. Jeyakumar","submitted_at":"2013-06-27T07:11:10Z","abstract_excerpt":"The Lasserre hierarchy of semidefinite programming (SDP) relaxations is an effective scheme for finding computationally feasible SDP approximations of polynomial optimization over compact semi-algebraic sets. In this paper, we show that, for convex polynomial optimization, the Lasserre hierarchy with a slightly extended quadratic module always converges asymptotically even in the face of non-compact semi-algebraic feasible sets. We do this by exploiting a coercivity property of convex polynomials that are bounded below. We further establish that the positive definiteness of the Hessian of the "},"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":"1306.6419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-27T07:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"96ff41c4a23df7c23e417df4b37c49e642534e770d77dfe65203c8c30ffcc76e","abstract_canon_sha256":"b3591500f22359189a0043fa7bed8cb043f17033d16e37ed92e50e2450c718f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:44.801142Z","signature_b64":"2CtTnkVg4CT8R3WDee6YfAqTu7St94I3eKNPEEerro4QLgUo1+2vL+rQS3XFh9B+K0GjNMOvFcwKlawc8OSTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","last_reissued_at":"2026-05-18T03:19:44.800548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:44.800548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of the Lasserre Hierarchy of SDP Relaxations for Convex Polynomial Programs without Compactness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, T. S. Pham, V. Jeyakumar","submitted_at":"2013-06-27T07:11:10Z","abstract_excerpt":"The Lasserre hierarchy of semidefinite programming (SDP) relaxations is an effective scheme for finding computationally feasible SDP approximations of polynomial optimization over compact semi-algebraic sets. In this paper, we show that, for convex polynomial optimization, the Lasserre hierarchy with a slightly extended quadratic module always converges asymptotically even in the face of non-compact semi-algebraic feasible sets. We do this by exploiting a coercivity property of convex polynomials that are bounded below. We further establish that the positive definiteness of the Hessian of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6419","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":"1306.6419","created_at":"2026-05-18T03:19:44.800666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6419v1","created_at":"2026-05-18T03:19:44.800666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6419","created_at":"2026-05-18T03:19:44.800666+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHIHPU533QHJ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHIHPU533QHJ4UVA","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHIHPU53","created_at":"2026-05-18T12:27:51.066281+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/LHIHPU533QHJ4UVAM23BLCY65K","json":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K.json","graph_json":"https://pith.science/api/pith-number/LHIHPU533QHJ4UVAM23BLCY65K/graph.json","events_json":"https://pith.science/api/pith-number/LHIHPU533QHJ4UVAM23BLCY65K/events.json","paper":"https://pith.science/paper/LHIHPU53"},"agent_actions":{"view_html":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K","download_json":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K.json","view_paper":"https://pith.science/paper/LHIHPU53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6419&json=true","fetch_graph":"https://pith.science/api/pith-number/LHIHPU533QHJ4UVAM23BLCY65K/graph.json","fetch_events":"https://pith.science/api/pith-number/LHIHPU533QHJ4UVAM23BLCY65K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/action/storage_attestation","attest_author":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/action/author_attestation","sign_citation":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/action/citation_signature","submit_replication":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/action/replication_record"}},"created_at":"2026-05-18T03:19:44.800666+00:00","updated_at":"2026-05-18T03:19:44.800666+00:00"}