{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QIDAL7WA56PARRD2H63N543KZS","short_pith_number":"pith:QIDAL7WA","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"},"canonical_sha256":"820605fec0ef9e08c47a3fb6def36acc9c311d6e878f22d8e5f5fa42ba98be21","source":{"kind":"arxiv","id":"1903.00459","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00459","created_at":"2026-05-17T23:44:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00459v2","created_at":"2026-05-17T23:44:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00459","created_at":"2026-05-17T23:44:29Z"},{"alias_kind":"pith_short_12","alias_value":"QIDAL7WA56PA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QIDAL7WA56PARRD2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QIDAL7WA","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QIDAL7WA56PARRD2H63N543KZS","target":"record","payload":{"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"},"canonical_sha256":"820605fec0ef9e08c47a3fb6def36acc9c311d6e878f22d8e5f5fa42ba98be21","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"},"source_kind":"arxiv","source_id":"1903.00459","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+Aj8+JKdCoVCnlvkwrsJzMuqe01cudXv7HSs+JK4cHC4XxoKgpjH9AhDCxFLXgqXSd746IYWz5b2qkARAuxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:39:48.459457Z"},"content_sha256":"2352b5845ff910543da908a6580b6da524b4fc221025a802fb32de2552e6057b","schema_version":"1.0","event_id":"sha256:2352b5845ff910543da908a6580b6da524b4fc221025a802fb32de2552e6057b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QIDAL7WA56PARRD2H63N543KZS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GG1hvboPsLvJWvcFM15oQGiogW1/OgD7GZyP4pgMsmoQJjyQP5rdHcsUkyMZIaQbOzAS9xlhfdwFplpKyskqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:39:48.460097Z"},"content_sha256":"ab306e01f97c9b48b609c46b126434b401665de62d9ede659bf625360647c322","schema_version":"1.0","event_id":"sha256:ab306e01f97c9b48b609c46b126434b401665de62d9ede659bf625360647c322"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/bundle.json","state_url":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIDAL7WA56PARRD2H63N543KZS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T15:39:48Z","links":{"resolver":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS","bundle":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/bundle.json","state":"https://pith.science/pith/QIDAL7WA56PARRD2H63N543KZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIDAL7WA56PARRD2H63N543KZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QIDAL7WA56PARRD2H63N543KZS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f2cb15136a58a0c267e4c562325f174992ad4c72d90411243363686492e9869d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T18:39:36Z","title_canon_sha256":"ff0e1b90fc58628ce9266042395ac2bb5e3b0d46aa826fa232346255eb5915c8"},"schema_version":"1.0","source":{"id":"1903.00459","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00459","created_at":"2026-05-17T23:44:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00459v2","created_at":"2026-05-17T23:44:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00459","created_at":"2026-05-17T23:44:29Z"},{"alias_kind":"pith_short_12","alias_value":"QIDAL7WA56PA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QIDAL7WA56PARRD2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QIDAL7WA","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ab306e01f97c9b48b609c46b126434b401665de62d9ede659bf625360647c322","target":"graph","created_at":"2026-05-17T23:44:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Javier Pena","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T18:39:36Z","title":"Generalized conditional subgradient and generalized mirror descent: duality, convergence, and symmetry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00459","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2352b5845ff910543da908a6580b6da524b4fc221025a802fb32de2552e6057b","target":"record","created_at":"2026-05-17T23:44:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f2cb15136a58a0c267e4c562325f174992ad4c72d90411243363686492e9869d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T18:39:36Z","title_canon_sha256":"ff0e1b90fc58628ce9266042395ac2bb5e3b0d46aa826fa232346255eb5915c8"},"schema_version":"1.0","source":{"id":"1903.00459","kind":"arxiv","version":2}},"canonical_sha256":"820605fec0ef9e08c47a3fb6def36acc9c311d6e878f22d8e5f5fa42ba98be21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"820605fec0ef9e08c47a3fb6def36acc9c311d6e878f22d8e5f5fa42ba98be21","first_computed_at":"2026-05-17T23:44:29.192181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:29.192181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FvpzPE9EVAkdJI8d2oC6QkuTpOvmSvqX8x8qo7OLMpnKlfA5JvHLUm5cnxc2Oc8mbm5Bx4/+OFMxVfvee/RCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:29.192690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00459","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2352b5845ff910543da908a6580b6da524b4fc221025a802fb32de2552e6057b","sha256:ab306e01f97c9b48b609c46b126434b401665de62d9ede659bf625360647c322"],"state_sha256":"0d382fc9e7a5763254b51d9871dd2f85d6bc26541a9ec64d9ddc3b83e148ed86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7yDeQlNmj49K7CrdIRepDhgz2Ztd2acbZyRc3jpyeYwVjgn2VUULRm0GGOmAVZNGIH2ItpCAwrT4d7H2tGSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:39:48.463425Z","bundle_sha256":"06a31d124e6f253f3bd5a97705c62cbf97294ee65f7260abb6192787e06163f8"}}