{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DYZAJHEZCV623QOXZI4EYTLOZL","short_pith_number":"pith:DYZAJHEZ","schema_version":"1.0","canonical_sha256":"1e32049c99157dadc1d7ca384c4d6ecad2a264dc28853adebfdbe5b43e455056","source":{"kind":"arxiv","id":"1501.01451","version":1},"attestation_state":"computed","paper":{"title":"An optimal subgradient algorithm for large-scale convex optimization in simple domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arnold Neumaier, Masoud Ahookhosh","submitted_at":"2015-01-07T11:42:19Z","abstract_excerpt":"This paper shows that the optimal subgradient algorithm, OSGA, proposed in \\cite{NeuO} can be used for solving structured large-scale convex constrained optimization problems. Only first-order information is required, and the optimal complexity bounds for both smooth and nonsmooth problems are attained. More specifically, we consider two classes of problems: (i) a convex objective with a simple closed convex domain, where the orthogonal projection on this feasible domain is efficiently available; (ii) a convex objective with a simple convex functional constraint. If we equip OSGA with an appro"},"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":"1501.01451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-07T11:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"ebbbad8a1a2bb9e59188850edd68e8c84a840bd076300e81758c27e83f3faa2a","abstract_canon_sha256":"785602ce9ad846ba5df48adc92a9b4367ca528f73ab512b7375f75e592d7a69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:54.195673Z","signature_b64":"3DpqSwdKGuSjniGgkZn/TAAXCmCgjZwd9ghBrEDflskZ7ISHmr2WFRdhftpDntmhPyj4889a5iKrleaaHNRoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e32049c99157dadc1d7ca384c4d6ecad2a264dc28853adebfdbe5b43e455056","last_reissued_at":"2026-05-18T02:29:54.195210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:54.195210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal subgradient algorithm for large-scale convex optimization in simple domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arnold Neumaier, Masoud Ahookhosh","submitted_at":"2015-01-07T11:42:19Z","abstract_excerpt":"This paper shows that the optimal subgradient algorithm, OSGA, proposed in \\cite{NeuO} can be used for solving structured large-scale convex constrained optimization problems. Only first-order information is required, and the optimal complexity bounds for both smooth and nonsmooth problems are attained. More specifically, we consider two classes of problems: (i) a convex objective with a simple closed convex domain, where the orthogonal projection on this feasible domain is efficiently available; (ii) a convex objective with a simple convex functional constraint. If we equip OSGA with an appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01451","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":"1501.01451","created_at":"2026-05-18T02:29:54.195283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01451v1","created_at":"2026-05-18T02:29:54.195283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01451","created_at":"2026-05-18T02:29:54.195283+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYZAJHEZCV62","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYZAJHEZCV623QOX","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYZAJHEZ","created_at":"2026-05-18T12:29:17.054201+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/DYZAJHEZCV623QOXZI4EYTLOZL","json":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL.json","graph_json":"https://pith.science/api/pith-number/DYZAJHEZCV623QOXZI4EYTLOZL/graph.json","events_json":"https://pith.science/api/pith-number/DYZAJHEZCV623QOXZI4EYTLOZL/events.json","paper":"https://pith.science/paper/DYZAJHEZ"},"agent_actions":{"view_html":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL","download_json":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL.json","view_paper":"https://pith.science/paper/DYZAJHEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01451&json=true","fetch_graph":"https://pith.science/api/pith-number/DYZAJHEZCV623QOXZI4EYTLOZL/graph.json","fetch_events":"https://pith.science/api/pith-number/DYZAJHEZCV623QOXZI4EYTLOZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL/action/storage_attestation","attest_author":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL/action/author_attestation","sign_citation":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL/action/citation_signature","submit_replication":"https://pith.science/pith/DYZAJHEZCV623QOXZI4EYTLOZL/action/replication_record"}},"created_at":"2026-05-18T02:29:54.195283+00:00","updated_at":"2026-05-18T02:29:54.195283+00:00"}