Načítá se...
A general double-proximal gradient algorithm for d.c. programming
The possibilities of exploiting the special structure of d.c. programs, which consist of optimising the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave p...
Uloženo v:
| Vydáno v: | Math Program |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Springer Berlin Heidelberg
2018
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6830843/ https://ncbi.nlm.nih.gov/pubmed/31762494 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s10107-018-1292-2 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|