{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QIDAL7WA56PARRD2H63N543KZS","short_pith_number":"pith:QIDAL7WA","schema_version":"1.0","canonical_sha256":"820605fec0ef9e08c47a3fb6def36acc9c311d6e878f22d8e5f5fa42ba98be21","source":{"kind":"arxiv","id":"1903.00459","version":2},"attestation_state":"computed","paper":{"title":"Generalized conditional subgradient and generalized mirror descent: duality, convergence, and symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pena","submitted_at":"2019-03-01T18:39:36Z","abstract_excerpt":"We provide new insight into a {\\em generalized conditional subgradient} algorithm and a {\\em generalized mirror descent} algorithm for the convex minimization problem \\[ \\min_x \\; \\{f(Ax) + h(x)\\}.\\] As Bach showed in [{\\em SIAM J. Optim.}, 25 (2015), pp. 115--129], applying either of these two algorithms to this problem is equivalent to applying the other one to its Fenchel dual. We leverage this duality relationship to develop new upper bounds and convergence results for the gap between the primal and dual iterates generated by these two algorithms. We also propose a new {\\em primal-dual hyb"},"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":"1903.00459","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T18:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"ff0e1b90fc58628ce9266042395ac2bb5e3b0d46aa826fa232346255eb5915c8","abstract_canon_sha256":"f2cb15136a58a0c267e4c562325f174992ad4c72d90411243363686492e9869d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:29.192690Z","signature_b64":"6FvpzPE9EVAkdJI8d2oC6QkuTpOvmSvqX8x8qo7OLMpnKlfA5JvHLUm5cnxc2Oc8mbm5Bx4/+OFMxVfvee/RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820605fec0ef9e08c47a3fb6def36acc9c311d6e878f22d8e5f5fa42ba98be21","last_reissued_at":"2026-05-17T23:44:29.192181Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:29.192181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized conditional subgradient and generalized mirror descent: duality, convergence, and symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pena","submitted_at":"2019-03-01T18:39:36Z","abstract_excerpt":"We provide new insight into a {\\em generalized conditional subgradient} algorithm and a {\\em generalized mirror descent} algorithm for the convex minimization problem \\[ \\min_x \\; \\{f(Ax) + h(x)\\}.\\] As Bach showed in [{\\em SIAM J. Optim.}, 25 (2015), pp. 115--129], applying either of these two algorithms to this problem is equivalent to applying the other one to its Fenchel dual. We leverage this duality relationship to develop new upper bounds and convergence results for the gap between the primal and dual iterates generated by these two algorithms. We also propose a new {\\em primal-dual hyb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00459","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":"1903.00459","created_at":"2026-05-17T23:44:29.192261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00459v2","created_at":"2026-05-17T23:44:29.192261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00459","created_at":"2026-05-17T23:44:29.192261+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIDAL7WA56PA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIDAL7WA56PARRD2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIDAL7WA","created_at":"2026-05-18T12:33:27.125529+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/QIDAL7WA56PARRD2H63N543KZS","json":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS.json","graph_json":"https://pith.science/api/pith-number/QIDAL7WA56PARRD2H63N543KZS/graph.json","events_json":"https://pith.science/api/pith-number/QIDAL7WA56PARRD2H63N543KZS/events.json","paper":"https://pith.science/paper/QIDAL7WA"},"agent_actions":{"view_html":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS","download_json":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS.json","view_paper":"https://pith.science/paper/QIDAL7WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00459&json=true","fetch_graph":"https://pith.science/api/pith-number/QIDAL7WA56PARRD2H63N543KZS/graph.json","fetch_events":"https://pith.science/api/pith-number/QIDAL7WA56PARRD2H63N543KZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/action/storage_attestation","attest_author":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/action/author_attestation","sign_citation":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/action/citation_signature","submit_replication":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/action/replication_record"}},"created_at":"2026-05-17T23:44:29.192261+00:00","updated_at":"2026-05-17T23:44:29.192261+00:00"}