{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RESEGWFCLYGZW2AD46ZPWO2AJN","short_pith_number":"pith:RESEGWFC","schema_version":"1.0","canonical_sha256":"89244358a25e0d9b6803e7b2fb3b404b4f683bc5382ede4966df746ca8efee14","source":{"kind":"arxiv","id":"1803.01329","version":3},"attestation_state":"computed","paper":{"title":"One Mirror Descent Algorithm for Convex Constrained Optimization Problems with non-standard growth properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander A. Titov, Fedor S. Stonyakin","submitted_at":"2018-03-04T10:10:47Z","abstract_excerpt":"The paper is devoted to a special Mirror Descent algorithm for problems of convex minimization with functional constraints. The objective function may not satisfy the Lipschitz condition, but it must necessarily have the Lipshitz-continuous gradient. We assume, that the functional constraint can be non-smooth, but satisfying the Lipschitz condition. In particular, such functionals appear in the well-known Truss Topology Design problem. Also we have applied the technique of restarts in the mentioned version of Mirror Descent for strongly convex problems. Some estimations for a rate of convergen"},"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":"1803.01329","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-04T10:10:47Z","cross_cats_sorted":[],"title_canon_sha256":"2e291e0b295a876a0f7039106da93945a4d379ea94fb74db16c027f75041733c","abstract_canon_sha256":"558a292cb661cddff2b50367ee5eef80f40abc5d05524240dc5e3f375da4be6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:30.921165Z","signature_b64":"bI18iyn75CpJf/FRc1ALVEkCsn9aKRAxYXkGghWm5xn/JPUrKuNJWHtFJIu1WGZQUDViwSdCJD/Q6923HPgfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89244358a25e0d9b6803e7b2fb3b404b4f683bc5382ede4966df746ca8efee14","last_reissued_at":"2026-05-18T00:18:30.920830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:30.920830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One Mirror Descent Algorithm for Convex Constrained Optimization Problems with non-standard growth properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander A. Titov, Fedor S. Stonyakin","submitted_at":"2018-03-04T10:10:47Z","abstract_excerpt":"The paper is devoted to a special Mirror Descent algorithm for problems of convex minimization with functional constraints. The objective function may not satisfy the Lipschitz condition, but it must necessarily have the Lipshitz-continuous gradient. We assume, that the functional constraint can be non-smooth, but satisfying the Lipschitz condition. In particular, such functionals appear in the well-known Truss Topology Design problem. Also we have applied the technique of restarts in the mentioned version of Mirror Descent for strongly convex problems. Some estimations for a rate of convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01329","kind":"arxiv","version":3},"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":"1803.01329","created_at":"2026-05-18T00:18:30.920882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01329v3","created_at":"2026-05-18T00:18:30.920882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01329","created_at":"2026-05-18T00:18:30.920882+00:00"},{"alias_kind":"pith_short_12","alias_value":"RESEGWFCLYGZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RESEGWFCLYGZW2AD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RESEGWFC","created_at":"2026-05-18T12:32:50.500415+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/RESEGWFCLYGZW2AD46ZPWO2AJN","json":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN.json","graph_json":"https://pith.science/api/pith-number/RESEGWFCLYGZW2AD46ZPWO2AJN/graph.json","events_json":"https://pith.science/api/pith-number/RESEGWFCLYGZW2AD46ZPWO2AJN/events.json","paper":"https://pith.science/paper/RESEGWFC"},"agent_actions":{"view_html":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN","download_json":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN.json","view_paper":"https://pith.science/paper/RESEGWFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01329&json=true","fetch_graph":"https://pith.science/api/pith-number/RESEGWFCLYGZW2AD46ZPWO2AJN/graph.json","fetch_events":"https://pith.science/api/pith-number/RESEGWFCLYGZW2AD46ZPWO2AJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN/action/storage_attestation","attest_author":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN/action/author_attestation","sign_citation":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN/action/citation_signature","submit_replication":"https://pith.science/pith/RESEGWFCLYGZW2AD46ZPWO2AJN/action/replication_record"}},"created_at":"2026-05-18T00:18:30.920882+00:00","updated_at":"2026-05-18T00:18:30.920882+00:00"}