How good are the proximal point algorithms? (Q3777808): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1223616 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: I. Bert Russak / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/01630568708816257 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030931777 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5584384 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Submonotone mappings and the proximal point algorithm / rank | |||
Normal rank |
Latest revision as of 15:55, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How good are the proximal point algorithms? |
scientific article |
Statements
How good are the proximal point algorithms? (English)
0 references
1987
0 references
proximal point algorithm
0 references
gradient minimization
0 references
0 references