{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SZIWCNR3OYHHFBXHF26M2PFITG","short_pith_number":"pith:SZIWCNR3","schema_version":"1.0","canonical_sha256":"965161363b760e7286e72ebccd3ca899a9bbde160919ffb6947aae5a068264c7","source":{"kind":"arxiv","id":"1509.08581","version":3},"attestation_state":"computed","paper":{"title":"Optimization over Sparse Symmetric Sets via a Nonmonotone Projected Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Zhaosong Lu","submitted_at":"2015-09-29T03:39:01Z","abstract_excerpt":"We consider the problem of minimizing a Lipschitz differentiable function over a class of sparse symmetric sets that has wide applications in engineering and science. For this problem, it is known that any accumulation point of the classical projected gradient (PG) method with a constant stepsize $1/L$ satisfies the $L$-stationarity optimality condition that was introduced in [3]. In this paper we introduce a new optimality condition that is stronger than the $L$-stationarity optimality condition. We also propose a nonmonotone projected gradient (NPG) method for this problem by incorporating s"},"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":"1509.08581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-29T03:39:01Z","cross_cats_sorted":["cs.LG","cs.NA","stat.CO","stat.ML"],"title_canon_sha256":"004d0853d44dadf695249af6d1072aa0c72b8eedb9667559968b384cae2513c3","abstract_canon_sha256":"568b5aec4d5a905047f029842233f2c1aae2e431eb3e7622c73ef27d9e21080b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:46.620832Z","signature_b64":"B9Igc9u6HYkycRPNLbhNGtRgfXO1A/m1rQPFXSqcdzoLNyHHIp8ofif/RATGIKwlAEJ4hVX54cPFkgeBU9k8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"965161363b760e7286e72ebccd3ca899a9bbde160919ffb6947aae5a068264c7","last_reissued_at":"2026-05-18T01:25:46.620400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:46.620400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization over Sparse Symmetric Sets via a Nonmonotone Projected Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Zhaosong Lu","submitted_at":"2015-09-29T03:39:01Z","abstract_excerpt":"We consider the problem of minimizing a Lipschitz differentiable function over a class of sparse symmetric sets that has wide applications in engineering and science. For this problem, it is known that any accumulation point of the classical projected gradient (PG) method with a constant stepsize $1/L$ satisfies the $L$-stationarity optimality condition that was introduced in [3]. In this paper we introduce a new optimality condition that is stronger than the $L$-stationarity optimality condition. We also propose a nonmonotone projected gradient (NPG) method for this problem by incorporating s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08581","kind":"arxiv","version":3},"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":"1509.08581","created_at":"2026-05-18T01:25:46.620458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08581v3","created_at":"2026-05-18T01:25:46.620458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08581","created_at":"2026-05-18T01:25:46.620458+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZIWCNR3OYHH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZIWCNR3OYHHFBXH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZIWCNR3","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.01998","citing_title":"Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG","json":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG.json","graph_json":"https://pith.science/api/pith-number/SZIWCNR3OYHHFBXHF26M2PFITG/graph.json","events_json":"https://pith.science/api/pith-number/SZIWCNR3OYHHFBXHF26M2PFITG/events.json","paper":"https://pith.science/paper/SZIWCNR3"},"agent_actions":{"view_html":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG","download_json":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG.json","view_paper":"https://pith.science/paper/SZIWCNR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08581&json=true","fetch_graph":"https://pith.science/api/pith-number/SZIWCNR3OYHHFBXHF26M2PFITG/graph.json","fetch_events":"https://pith.science/api/pith-number/SZIWCNR3OYHHFBXHF26M2PFITG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG/action/storage_attestation","attest_author":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG/action/author_attestation","sign_citation":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG/action/citation_signature","submit_replication":"https://pith.science/pith/SZIWCNR3OYHHFBXHF26M2PFITG/action/replication_record"}},"created_at":"2026-05-18T01:25:46.620458+00:00","updated_at":"2026-05-18T01:25:46.620458+00:00"}