{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EQ4EYDFEWV3PMGLPGB7IJHVKGA","short_pith_number":"pith:EQ4EYDFE","schema_version":"1.0","canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","source":{"kind":"arxiv","id":"1906.11580","version":1},"attestation_state":"computed","paper":{"title":"Gradient projection and conditional gradient methods for constrained nonconvex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Tremba, Boris Polyak, Maxim Balashov","submitted_at":"2019-06-27T12:09:58Z","abstract_excerpt":"Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solution and to obtain results that guarantee convergence of the algorithm under some minimal natural assumptions. We use the Lezanski-Polyak-Lojasiewicz condition on a manifold to prove the global linear convergence of the algorithm. Another method well fitted for the problem is the conditional gradient (Frank-Wolfe) algorithm. We examine some conditio"},"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":"1906.11580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-27T12:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"7094e2b52a8c4aa9b6b121d311e72164903bb07e846f835c037fccfcf78ca90f","abstract_canon_sha256":"9a8d87306a62b0c872f30e6b6bc22a38591267c6e44ef1423a07347d4988d119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.401506Z","signature_b64":"+qqe6ycKKXu1X5d7tEQ0LGmJNXBivcqyyquksUllLAEtAaC+wb/FRqhu1eM7vm1QKPOZcBlk7vjzw9WVRJhWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","last_reissued_at":"2026-05-17T23:42:04.400921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.400921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient projection and conditional gradient methods for constrained nonconvex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Tremba, Boris Polyak, Maxim Balashov","submitted_at":"2019-06-27T12:09:58Z","abstract_excerpt":"Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solution and to obtain results that guarantee convergence of the algorithm under some minimal natural assumptions. We use the Lezanski-Polyak-Lojasiewicz condition on a manifold to prove the global linear convergence of the algorithm. Another method well fitted for the problem is the conditional gradient (Frank-Wolfe) algorithm. We examine some conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11580","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":"1906.11580","created_at":"2026-05-17T23:42:04.401023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11580v1","created_at":"2026-05-17T23:42:04.401023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11580","created_at":"2026-05-17T23:42:04.401023+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQ4EYDFEWV3P","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQ4EYDFEWV3PMGLP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQ4EYDFE","created_at":"2026-05-18T12:33:15.570797+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/EQ4EYDFEWV3PMGLPGB7IJHVKGA","json":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA.json","graph_json":"https://pith.science/api/pith-number/EQ4EYDFEWV3PMGLPGB7IJHVKGA/graph.json","events_json":"https://pith.science/api/pith-number/EQ4EYDFEWV3PMGLPGB7IJHVKGA/events.json","paper":"https://pith.science/paper/EQ4EYDFE"},"agent_actions":{"view_html":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA","download_json":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA.json","view_paper":"https://pith.science/paper/EQ4EYDFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11580&json=true","fetch_graph":"https://pith.science/api/pith-number/EQ4EYDFEWV3PMGLPGB7IJHVKGA/graph.json","fetch_events":"https://pith.science/api/pith-number/EQ4EYDFEWV3PMGLPGB7IJHVKGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/action/storage_attestation","attest_author":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/action/author_attestation","sign_citation":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/action/citation_signature","submit_replication":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/action/replication_record"}},"created_at":"2026-05-17T23:42:04.401023+00:00","updated_at":"2026-05-17T23:42:04.401023+00:00"}