{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FHI4U4GLW5NOJ6FY3GGIQ3L6OM","short_pith_number":"pith:FHI4U4GL","schema_version":"1.0","canonical_sha256":"29d1ca70cbb75ae4f8b8d98c886d7e73162973fca614833dc619f093638da997","source":{"kind":"arxiv","id":"2105.14033","version":2},"attestation_state":"computed","paper":{"title":"An Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"math.OC","authors_text":"Heng Yang, Kim-Chuan Toh, Ling Liang, Luca Carlone","submitted_at":"2021-05-28T18:07:16Z","abstract_excerpt":"We consider solving high-order semidefinite programming (SDP) relaxations of nonconvex polynomial optimization problems (POPs) that often admit degenerate rank-one optimal solutions. Instead of solving the SDP alone, we propose a new algorithmic framework that blends local search using the nonconvex POP into global descent using the convex SDP. In particular, we first design a globally convergent inexact projected gradient method (iPGM) for solving the SDP that serves as the backbone of our framework. We then accelerate iPGM by taking long, but safeguarded, rank-one steps generated by fast non"},"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":"2105.14033","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-28T18:07:16Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"e0864062b676055c30398ca73ea2f3119f27836c5c6362db3eaad0794b96b11b","abstract_canon_sha256":"40cdd604703fae94fcc09f63f1d6a4ee5087b0a60d726bbe880648f82d9be580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:56.772459Z","signature_b64":"x2wIPBIHDOUuQsEszTNl1StdL9OUrUm2mIXu0gJDidIt1FLpEqoh76C2Mu4Hz4zFPgreT5i21kpEAOnIfk3GBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d1ca70cbb75ae4f8b8d98c886d7e73162973fca614833dc619f093638da997","last_reissued_at":"2026-07-05T03:25:56.772013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:56.772013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"math.OC","authors_text":"Heng Yang, Kim-Chuan Toh, Ling Liang, Luca Carlone","submitted_at":"2021-05-28T18:07:16Z","abstract_excerpt":"We consider solving high-order semidefinite programming (SDP) relaxations of nonconvex polynomial optimization problems (POPs) that often admit degenerate rank-one optimal solutions. Instead of solving the SDP alone, we propose a new algorithmic framework that blends local search using the nonconvex POP into global descent using the convex SDP. In particular, we first design a globally convergent inexact projected gradient method (iPGM) for solving the SDP that serves as the backbone of our framework. We then accelerate iPGM by taking long, but safeguarded, rank-one steps generated by fast non"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.14033","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.14033/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":"2105.14033","created_at":"2026-07-05T03:25:56.772077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.14033v2","created_at":"2026-07-05T03:25:56.772077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.14033","created_at":"2026-07-05T03:25:56.772077+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHI4U4GLW5NO","created_at":"2026-07-05T03:25:56.772077+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHI4U4GLW5NOJ6FY","created_at":"2026-07-05T03:25:56.772077+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHI4U4GL","created_at":"2026-07-05T03:25:56.772077+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/FHI4U4GLW5NOJ6FY3GGIQ3L6OM","json":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM.json","graph_json":"https://pith.science/api/pith-number/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/graph.json","events_json":"https://pith.science/api/pith-number/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/events.json","paper":"https://pith.science/paper/FHI4U4GL"},"agent_actions":{"view_html":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM","download_json":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM.json","view_paper":"https://pith.science/paper/FHI4U4GL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.14033&json=true","fetch_graph":"https://pith.science/api/pith-number/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/graph.json","fetch_events":"https://pith.science/api/pith-number/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/action/storage_attestation","attest_author":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/action/author_attestation","sign_citation":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/action/citation_signature","submit_replication":"https://pith.science/pith/FHI4U4GLW5NOJ6FY3GGIQ3L6OM/action/replication_record"}},"created_at":"2026-07-05T03:25:56.772077+00:00","updated_at":"2026-07-05T03:25:56.772077+00:00"}