このページの2つのバージョン間の差分を表示します。
| 両方とも前のリビジョン 前のリビジョン | |
| en:news [2018/06/01 16:36] – 外部編集 127.0.0.1 | en:news [2018/11/08 23:02] (現在) – kaz |
|---|
| ====== Old News ====== | ====== Old News ====== |
| ※Please see [[:en|Top]] for resent news. | ※Please see [[:en|Top]] for resent news. |
| | |
| | ===== 2018 ===== |
| | * 2018/09/23: You can see a full-text view-only version of our paper "Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings" in Mathematical Programming by using [[https://rdcu.be/7uNw|this link]]. |
| | * 2018/06/01: URL of our website has been moved to [[https://iiduka.net]]. Your browser will be automatically forwarded to new URLs when you access old ones. |
| | |
| | ===== 2017 ===== |
| | * 2017/11/02: Please use [[https://authors.elsevier.com/c/1V~dr3INuk2mRE|this link]] which will provide free access to our article "[[http://www.sciencedirect.com/science/article/pii/S0925231217313486|Optimality and convergence for convex ensemble learning with sparsity and diversity based on fixed point optimization]]", and is valid for 50 days, until December 22, 2017. |
| | * 2017/11/01: Our article "[[http://www.sciencedirect.com/science/article/pii/S0925231217313486|Optimality and convergence for convex ensemble learning with sparsity and diversity based on fixed point optimization]]" ({{:iiduka:h_i_neucom2017.pdf|PDF}}) has been accepted for publication in the [[https://www.journals.elsevier.com/neurocomputing/|Neurocomputing]]. It proposes sparsity and diversity learning methods with fixed point optimization algorithms. Please see {{:iiduka:h_i_neucom2017.pdf|PDF}}. |
| |
| ===== 2016 ===== | ===== 2016 ===== |