{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OGRMLETC6DX2IM4HX6BLCJUKS6","short_pith_number":"pith:OGRMLETC","schema_version":"1.0","canonical_sha256":"71a2c59262f0efa43387bf82b1268a97bda8188d6f9ed35c0c37324b2d332077","source":{"kind":"arxiv","id":"1507.04404","version":2},"attestation_state":"computed","paper":{"title":"Bound-constrained polynomial optimization using only elementary calculations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Jean Lasserre, Monique Laurent, Zhao Sun","submitted_at":"2015-07-15T22:06:47Z","abstract_excerpt":"We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper bounds in [J.B. Lasserre, A new look at nonnegativity on closed sets and polynomial optimization, SIAM J. Optim. 21, pp. 864--885, 2010] is that only elementary computations are required. For optimization over the hypercube, we show that the new bounds $f^H_k$ have a rate of convergence in $O(1/\\sqrt {k})$. Moreover we show a stronger convergence rate in $O(1/k)$"},"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":"1507.04404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-15T22:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"8c08de77b82a1e1456b429bf5c604d91b782caa8fb977d9a40caafba3f33a42c","abstract_canon_sha256":"6ff00d47eddf6397060e8d6133bc932bc77a879fa59bb5941e0e8e09beebef4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:44.774688Z","signature_b64":"BUL7QwLY29qjvX0szQxW/Wi+b5qHMUN6A+XprIbBMI9xMfQd2dG4A0cCV6IPSJ+9Dg0XhJu+XTpeH1etN0Q6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a2c59262f0efa43387bf82b1268a97bda8188d6f9ed35c0c37324b2d332077","last_reissued_at":"2026-05-18T01:13:44.773974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:44.773974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bound-constrained polynomial optimization using only elementary calculations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Jean Lasserre, Monique Laurent, Zhao Sun","submitted_at":"2015-07-15T22:06:47Z","abstract_excerpt":"We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper bounds in [J.B. Lasserre, A new look at nonnegativity on closed sets and polynomial optimization, SIAM J. Optim. 21, pp. 864--885, 2010] is that only elementary computations are required. For optimization over the hypercube, we show that the new bounds $f^H_k$ have a rate of convergence in $O(1/\\sqrt {k})$. Moreover we show a stronger convergence rate in $O(1/k)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04404","kind":"arxiv","version":2},"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":"1507.04404","created_at":"2026-05-18T01:13:44.774077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04404v2","created_at":"2026-05-18T01:13:44.774077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04404","created_at":"2026-05-18T01:13:44.774077+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGRMLETC6DX2","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGRMLETC6DX2IM4H","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGRMLETC","created_at":"2026-05-18T12:29:34.919912+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/OGRMLETC6DX2IM4HX6BLCJUKS6","json":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6.json","graph_json":"https://pith.science/api/pith-number/OGRMLETC6DX2IM4HX6BLCJUKS6/graph.json","events_json":"https://pith.science/api/pith-number/OGRMLETC6DX2IM4HX6BLCJUKS6/events.json","paper":"https://pith.science/paper/OGRMLETC"},"agent_actions":{"view_html":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6","download_json":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6.json","view_paper":"https://pith.science/paper/OGRMLETC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04404&json=true","fetch_graph":"https://pith.science/api/pith-number/OGRMLETC6DX2IM4HX6BLCJUKS6/graph.json","fetch_events":"https://pith.science/api/pith-number/OGRMLETC6DX2IM4HX6BLCJUKS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6/action/storage_attestation","attest_author":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6/action/author_attestation","sign_citation":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6/action/citation_signature","submit_replication":"https://pith.science/pith/OGRMLETC6DX2IM4HX6BLCJUKS6/action/replication_record"}},"created_at":"2026-05-18T01:13:44.774077+00:00","updated_at":"2026-05-18T01:13:44.774077+00:00"}