{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3A7EUMMO2M3SG3EEWUR6ZF7S7K","short_pith_number":"pith:3A7EUMMO","schema_version":"1.0","canonical_sha256":"d83e4a318ed337236c84b523ec97f2fa9b7919de73e609c0c731d2dea91011c9","source":{"kind":"arxiv","id":"1703.09280","version":2},"attestation_state":"computed","paper":{"title":"Radial Subgradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Grimmer","submitted_at":"2017-03-27T19:40:29Z","abstract_excerpt":"We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different perspective, leading to an algorithm which is conceptually more natural, has notably improved convergence rates, and for which the analysis is surprisingly simple. At each iteration, the algorithm takes a subgradient step and then performs a line search to move radially towards (or away from) the known feasible point. Our convergence results have striking similarities"},"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":"1703.09280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-27T19:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"a783038b3c3904cec0923a1c3fed1b3fb86f7c23d52aff5c4d5b5cde4ba8e125","abstract_canon_sha256":"bbde2cf110a9e4f0c4d82a5a0eab2fb4187c48611534ef7d1489cdd176e325f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:33.404126Z","signature_b64":"8CrPA81/K/6VCPgrbrGJsJ5r2RUZ9EdkpZ75eakvQCScusBVvsTv9gdgpMskRGiaGVQUYojJbQHLrHChzFg/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d83e4a318ed337236c84b523ec97f2fa9b7919de73e609c0c731d2dea91011c9","last_reissued_at":"2026-05-18T00:22:33.403537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:33.403537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Radial Subgradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Grimmer","submitted_at":"2017-03-27T19:40:29Z","abstract_excerpt":"We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different perspective, leading to an algorithm which is conceptually more natural, has notably improved convergence rates, and for which the analysis is surprisingly simple. At each iteration, the algorithm takes a subgradient step and then performs a line search to move radially towards (or away from) the known feasible point. Our convergence results have striking similarities"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09280","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":"1703.09280","created_at":"2026-05-18T00:22:33.403629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09280v2","created_at":"2026-05-18T00:22:33.403629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09280","created_at":"2026-05-18T00:22:33.403629+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A7EUMMO2M3S","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A7EUMMO2M3SG3EE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A7EUMMO","created_at":"2026-05-18T12:30:58.224056+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/3A7EUMMO2M3SG3EEWUR6ZF7S7K","json":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K.json","graph_json":"https://pith.science/api/pith-number/3A7EUMMO2M3SG3EEWUR6ZF7S7K/graph.json","events_json":"https://pith.science/api/pith-number/3A7EUMMO2M3SG3EEWUR6ZF7S7K/events.json","paper":"https://pith.science/paper/3A7EUMMO"},"agent_actions":{"view_html":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K","download_json":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K.json","view_paper":"https://pith.science/paper/3A7EUMMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09280&json=true","fetch_graph":"https://pith.science/api/pith-number/3A7EUMMO2M3SG3EEWUR6ZF7S7K/graph.json","fetch_events":"https://pith.science/api/pith-number/3A7EUMMO2M3SG3EEWUR6ZF7S7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K/action/storage_attestation","attest_author":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K/action/author_attestation","sign_citation":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K/action/citation_signature","submit_replication":"https://pith.science/pith/3A7EUMMO2M3SG3EEWUR6ZF7S7K/action/replication_record"}},"created_at":"2026-05-18T00:22:33.403629+00:00","updated_at":"2026-05-18T00:22:33.403629+00:00"}