Loading...
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
The Alternating Minimization Algorithm has been proposed by Paul Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. The fact that one of the subproblems to be...
Na minha lista:
| Udgivet i: | J Optim Theory Appl |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Springer US
2018
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6560466/ https://ncbi.nlm.nih.gov/pubmed/31258180 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s10957-018-01454-y |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|