ロード中...
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...
保存先:
| 出版年: | Math Program |
|---|---|
| 主要な著者: | , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Springer Berlin Heidelberg
2018
|
| 主題: | |
| オンライン･アクセス: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|