{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DGLSA6X4NTX6NCJUXMXCNQX2FI","short_pith_number":"pith:DGLSA6X4","schema_version":"1.0","canonical_sha256":"1997207afc6cefe68934bb2e26c2fa2a00294982340d0eadf5b3b721476926ea","source":{"kind":"arxiv","id":"1609.04869","version":1},"attestation_state":"computed","paper":{"title":"Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"G. C. Bento, J. G. Melo, O. P. Ferreira","submitted_at":"2016-09-15T21:53:23Z","abstract_excerpt":"This paper considers optimization problems on Riemannian manifolds and analyzes iteration-complexity for gradient and subgradient methods on manifolds with non-negative curvature. By using tools from the Riemannian convex analysis and exploring directly the tangent space of the manifold, we obtain different iteration-complexity bounds for the aforementioned methods, complementing and improving related results. Moreover, we also establish iteration-complexity bound for the proximal point method on Hadamard manifolds."},"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":"1609.04869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-15T21:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"65a2f12e01bea539286958666f938e9ddc47afa3f96656291b16330c72264263","abstract_canon_sha256":"7265d5b45862dec489917d86aa1016737fcdab40b769e7157c28a8ebb844a1e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:32.245860Z","signature_b64":"YRHneE90j9yapkwG0LfQZLfbERftk/7njGWAveSwa3cFv3rPHj9thRUNQBTNAmjUg3EQpUeio8euy0U5W51TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1997207afc6cefe68934bb2e26c2fa2a00294982340d0eadf5b3b721476926ea","last_reissued_at":"2026-05-18T01:04:32.245153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:32.245153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"G. C. Bento, J. G. Melo, O. P. Ferreira","submitted_at":"2016-09-15T21:53:23Z","abstract_excerpt":"This paper considers optimization problems on Riemannian manifolds and analyzes iteration-complexity for gradient and subgradient methods on manifolds with non-negative curvature. By using tools from the Riemannian convex analysis and exploring directly the tangent space of the manifold, we obtain different iteration-complexity bounds for the aforementioned methods, complementing and improving related results. Moreover, we also establish iteration-complexity bound for the proximal point method on Hadamard manifolds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04869","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":"1609.04869","created_at":"2026-05-18T01:04:32.245283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04869v1","created_at":"2026-05-18T01:04:32.245283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04869","created_at":"2026-05-18T01:04:32.245283+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGLSA6X4NTX6","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGLSA6X4NTX6NCJU","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGLSA6X4","created_at":"2026-05-18T12:30:12.583610+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/DGLSA6X4NTX6NCJUXMXCNQX2FI","json":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI.json","graph_json":"https://pith.science/api/pith-number/DGLSA6X4NTX6NCJUXMXCNQX2FI/graph.json","events_json":"https://pith.science/api/pith-number/DGLSA6X4NTX6NCJUXMXCNQX2FI/events.json","paper":"https://pith.science/paper/DGLSA6X4"},"agent_actions":{"view_html":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI","download_json":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI.json","view_paper":"https://pith.science/paper/DGLSA6X4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04869&json=true","fetch_graph":"https://pith.science/api/pith-number/DGLSA6X4NTX6NCJUXMXCNQX2FI/graph.json","fetch_events":"https://pith.science/api/pith-number/DGLSA6X4NTX6NCJUXMXCNQX2FI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI/action/storage_attestation","attest_author":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI/action/author_attestation","sign_citation":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI/action/citation_signature","submit_replication":"https://pith.science/pith/DGLSA6X4NTX6NCJUXMXCNQX2FI/action/replication_record"}},"created_at":"2026-05-18T01:04:32.245283+00:00","updated_at":"2026-05-18T01:04:32.245283+00:00"}