{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BEGAZVXSUJEEB3RPBRPT6WPWJR","short_pith_number":"pith:BEGAZVXS","schema_version":"1.0","canonical_sha256":"090c0cd6f2a24840ee2f0c5f3f59f64c7c2e62569759d45a01fd0c16509f56d6","source":{"kind":"arxiv","id":"1801.08011","version":1},"attestation_state":"computed","paper":{"title":"A Conceptual Conjugate Epi-Projection Algorithm of Convex Optimization: Superlinear, Quadratic and Finite Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Evgeni Nurminski","submitted_at":"2018-01-24T15:05:23Z","abstract_excerpt":"This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated projection onto the epigraph of conjugate function. Whilst the projection problem is not exactly solvable in finite space-time it can be approximately solved up to arbitrary precision by simple iterative methods, which use linear support functions of the epigraph. It seems therefore useful to study computational characteristics of the idealized version of this "},"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":"1801.08011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-24T15:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"2e2d9c11af4abfeff00c7ec3404e64c3f624a036088a8ddd861074b6225ac3ed","abstract_canon_sha256":"d2644df37a8848e2cb86fc35473fa89fdb4aa68746edc836f269efa6b4a70401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:10.517400Z","signature_b64":"+QhX0uE+T5bQFlSGAUfu1euq+6ToeNCmZw/s9BuHAvpJDqeU9NW4bieU7HKpU3BbWSvSGk+akZL8YXASEudZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090c0cd6f2a24840ee2f0c5f3f59f64c7c2e62569759d45a01fd0c16509f56d6","last_reissued_at":"2026-05-18T00:13:10.516705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:10.516705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Conceptual Conjugate Epi-Projection Algorithm of Convex Optimization: Superlinear, Quadratic and Finite Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Evgeni Nurminski","submitted_at":"2018-01-24T15:05:23Z","abstract_excerpt":"This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated projection onto the epigraph of conjugate function. Whilst the projection problem is not exactly solvable in finite space-time it can be approximately solved up to arbitrary precision by simple iterative methods, which use linear support functions of the epigraph. It seems therefore useful to study computational characteristics of the idealized version of this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08011","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":"1801.08011","created_at":"2026-05-18T00:13:10.516836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08011v1","created_at":"2026-05-18T00:13:10.516836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08011","created_at":"2026-05-18T00:13:10.516836+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEGAZVXSUJEE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEGAZVXSUJEEB3RP","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEGAZVXS","created_at":"2026-05-18T12:32:13.499390+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/BEGAZVXSUJEEB3RPBRPT6WPWJR","json":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR.json","graph_json":"https://pith.science/api/pith-number/BEGAZVXSUJEEB3RPBRPT6WPWJR/graph.json","events_json":"https://pith.science/api/pith-number/BEGAZVXSUJEEB3RPBRPT6WPWJR/events.json","paper":"https://pith.science/paper/BEGAZVXS"},"agent_actions":{"view_html":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR","download_json":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR.json","view_paper":"https://pith.science/paper/BEGAZVXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08011&json=true","fetch_graph":"https://pith.science/api/pith-number/BEGAZVXSUJEEB3RPBRPT6WPWJR/graph.json","fetch_events":"https://pith.science/api/pith-number/BEGAZVXSUJEEB3RPBRPT6WPWJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR/action/storage_attestation","attest_author":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR/action/author_attestation","sign_citation":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR/action/citation_signature","submit_replication":"https://pith.science/pith/BEGAZVXSUJEEB3RPBRPT6WPWJR/action/replication_record"}},"created_at":"2026-05-18T00:13:10.516836+00:00","updated_at":"2026-05-18T00:13:10.516836+00:00"}