An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming (Q2326924): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127128485, #quickstatements; #temporary_batch_1722544330843 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s40314-019-0949-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S40314-019-0949-7 / rank | |||
Normal rank | |||
Latest revision as of 00:45, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming |
scientific article |
Statements
An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming (English)
0 references
10 October 2019
0 references
convex programming
0 references
Peaceman-Rachford splitting method
0 references
substitution
0 references
variational inequality
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
