差分

このページの2つのバージョン間の差分を表示します。

--- en:news [2016/03/10 11:46] – Hideaki IIDUKA
+++ en:news [2018/11/08 23:02] (現在) – kaz
@@ 行 1: / 行 1: @@
 ====== Old 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/10/20: Our article "Almost Sure Convergence of Random Projected Proximal and Subgradient Algorithms for Distributed Nonsmooth Convex Optimization" ({{:iiduka:GOPT_iiduka.pdf|PDF}}) has been accepted for publication in the [[http://www.tandfonline.com/toc/gopt20/current|Optimization]].
+  * 2016/08/14: Our article "[[http://link.springer.com/article/10.1007/s10107-015-0967-1|Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings]]" has now been published in Mathematical Programming, 159(1), 509-538.
+  * 2016/07/09: Our paper "Line Search Fixed Point Algorithms Based on Nonlinear Conjugate Gradient Directions: Application to Constrained Smooth Convex Optimization" ([[http://download.springer.com/static/pdf/569/art%253A10.1186%252Fs13663-016-0567-7.pdf?originUrl=http%3A%2F%2Ffixedpointtheoryandapplications.springeropen.com%2Farticle%2F10.1186%2Fs13663-016-0567-7&token2=exp=1468029750~acl=%2Fstatic%2Fpdf%2F569%2Fart%25253A10.1186%25252Fs13663-016-0567-7.pdf*~hmac=c724b9129b32b7290cb6fd768ed09e09af38f0b498f645e497cdd990cca839af|PDF]]) has been accepted for publication in the [[http://fixedpointtheoryandapplications.springeropen.com/|Fixed Point Theory and Applications]].
+  * 2016/04/14: Please use [[http://authors.elsevier.com/a/1St4Y1LnJ6PjKk|this link]] which will provide free access to our article [[http://www.sciencedirect.com/science/article/pii/S0377221716301102|Proximal Point Algorithms for Nonsmooth Convex Optimization with Fixed Point Constraints]], and is valid for 50 days, until June 2, 2016.
+  * 2016/04/03: Our paper "Incremental Subgradient Method for Nonsmooth Convex Optimization with Fixed Point Constraints" ({{:iiduka:OMS2016.pdf|PDF}}) has been accepted for publication in the [[http://www.tandfonline.com/action/journalInformation?show=aimsScope&journalCode=goms20#.VwB9oxOLT3B|Optimization Methods and Software]]. Please see Section 5 in [[http://www.sciencedirect.com/science/article/pii/S0377221716301102|Proximal Point Algorithms for Nonsmooth Convex Optimization with Fixed Point Constraints]] for the numerical comparisons of the proposed subgradient method with the proximal point ones.
+  * 2016/04/02: Our paper "[[http://www.sciencedirect.com/science/article/pii/S0377221716301102|Proximal Point Algorithms for Nonsmooth Convex Optimization with Fixed Point Constraints]]" is now available online.
+  * 2016/03/01: Our paper "[[http://www.sciencedirect.com/science/article/pii/S0377221716301102|Proximal Point Algorithms for Nonsmooth Convex Optimization with Fixed Point Constraints]]" ({{:iiduka:iiduka_EJOR.pdf|PDF}}) has been accepted for publication in the [[http://www.journals.elsevier.com/european-journal-of-operational-research/|European Journal of Operational Research]].
   * 2016/01/29: Our paper [[http://www.tandfonline.com/doi/full/10.1080/01630563.2015.1080270|Optimization for Inconsistent Split Feasibility Problems]] has been published on Taylor & Francis Online.
   * 2016/01/05: We wish you a very happy New Year!