{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DWSHSEHRS5CGKOVZ2XCBUS7ZVS","short_pith_number":"pith:DWSHSEHR","schema_version":"1.0","canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","source":{"kind":"arxiv","id":"1812.03763","version":1},"attestation_state":"computed","paper":{"title":"General parameterized proximal point algorithm with applications in statistical learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianchao Bai, Jiaofen Li, Jicheng Li, Pingfan Dai","submitted_at":"2018-12-10T12:42:44Z","abstract_excerpt":"In the literature, there are a few researches to design some parameters in the Proximal Point Algorithm (PPA), especially for the multi-objective convex optimizations. Introducing some parameters to PPA can make it more flexible and attractive. Mainly motivated by our recent work (Bai et al., A parameterized proximal point algorithm for separable convex optimization, Optim. Lett. (2017) doi: 10.1007/s11590-017-1195-9), in this paper we develop a general parameterized PPA with a relaxation step for solving the multi-block separable structured convex programming. By making use of the variational"},"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":"1812.03763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-10T12:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"aa8ff062c337f3b21e00659443cb9157955e5adde40ccba57dc909b7f111f71b","abstract_canon_sha256":"83dff397769d92d3d622166d705e474ba81b4bb5d1f9f22746dc9c527678a660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.923850Z","signature_b64":"RiHi86LkYw/7AJS7dkk0u00RCAZbQ6YRxtKVsfvlfUva+sMUSvfwHGaAArONWH+U8+m3fQda5CXC1CSGDsUoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","last_reissued_at":"2026-05-17T23:58:43.923287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.923287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General parameterized proximal point algorithm with applications in statistical learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianchao Bai, Jiaofen Li, Jicheng Li, Pingfan Dai","submitted_at":"2018-12-10T12:42:44Z","abstract_excerpt":"In the literature, there are a few researches to design some parameters in the Proximal Point Algorithm (PPA), especially for the multi-objective convex optimizations. Introducing some parameters to PPA can make it more flexible and attractive. Mainly motivated by our recent work (Bai et al., A parameterized proximal point algorithm for separable convex optimization, Optim. Lett. (2017) doi: 10.1007/s11590-017-1195-9), in this paper we develop a general parameterized PPA with a relaxation step for solving the multi-block separable structured convex programming. By making use of the variational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03763","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":"1812.03763","created_at":"2026-05-17T23:58:43.923369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03763v1","created_at":"2026-05-17T23:58:43.923369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03763","created_at":"2026-05-17T23:58:43.923369+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWSHSEHRS5CG","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWSHSEHRS5CGKOVZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWSHSEHR","created_at":"2026-05-18T12:32:19.392346+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/DWSHSEHRS5CGKOVZ2XCBUS7ZVS","json":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS.json","graph_json":"https://pith.science/api/pith-number/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/graph.json","events_json":"https://pith.science/api/pith-number/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/events.json","paper":"https://pith.science/paper/DWSHSEHR"},"agent_actions":{"view_html":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS","download_json":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS.json","view_paper":"https://pith.science/paper/DWSHSEHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03763&json=true","fetch_graph":"https://pith.science/api/pith-number/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/graph.json","fetch_events":"https://pith.science/api/pith-number/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/action/storage_attestation","attest_author":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/action/author_attestation","sign_citation":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/action/citation_signature","submit_replication":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/action/replication_record"}},"created_at":"2026-05-17T23:58:43.923369+00:00","updated_at":"2026-05-17T23:58:43.923369+00:00"}