差分

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

この比較画面へのリンク

両方とも前のリビジョン 前のリビジョン
次のリビジョン
前のリビジョン
次のリビジョン両方とも次のリビジョン
en:default [2017/01/29 12:35] kazen:default [2021/09/07 12:33] Hideaki IIDUKA
行 1: 行 1:
 ====== Welcome to Mathematical Optimization Laboratory! ====== ====== Welcome to Mathematical Optimization Laboratory! ======
 ~~NOTOC~~ ~~NOTOC~~
-{{keywords>Meiji University,Mathematical Optimization,Fixed Point Theory,Hideaki Iiduka}} 
  
 This is an official website of Mathematical Optimization Lab., Meiji Univ.\\ This is an official website of Mathematical Optimization Lab., Meiji Univ.\\
 We research optimization theory and its applications to mathematical information science. We research optimization theory and its applications to mathematical information science.
  
-[[https://kaken.nii.ac.jp/d/p/15K04763.en.html|{{ :kakenhi.jpg|}}]]+<WRAP rightalign> 
 +[[https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-21K11773/|{{:kakenhi.jpg|}}]] 
 +</WRAP>
  
 /* /*
-<html><script type="text/javascript">jQuery(function($){$(".bx-wrapper,.bx-viewport").css({width:"320px", height:"240px"});});</script></html> +{{ :en:yukobayashi.jpg?640&nolink |}} 
-<slider dai2.jpg> +<WRAP rightalign>The photo is taken at the celebration party of Prof Iiduka's promotion (Aug17th, 2019).</WRAP>
-<slider labo10.jpg> +
-<slider labo03.jpg> +
-</slider> +
-{{ :mocstop.m4v|320x240|loop,autoplay }}+
 */ */
  
-[[:en:iiduka:|{{  :mocstop6.jpg?nolink&320x240  }}]]+[[|{{ :iiduka:20210906.jpg?480 |}}]]
  
-<WRAP round info><WRAP box> +/* vvvvv Facebook 埋め込むやつ vvvvv */ 
-//**__What's New__**/+<html><div style="text-align:center"><iframe src="https://www.facebook.com/plugins/page.php?href=https%3A%2F%2Fwww.facebook.com%2Fiidukanet&tabs=timeline&width=500&height=500&small_header=true&adapt_container_width=true&hide_cover=true&show_facepile=false&appId=772928636127053width="500" height="500" style="border:none;overflow:hiddenscrolling="noframeborder="0" allowTransparency="true" allow="encrypted-media"></iframe></div></html> 
-  * 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]]. +/* ^^^^^ Facebook 埋め込むやつ ^^^^^ */
-  * 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/09Our 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/02Our 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]]. +
-<WRAP rightalign>[[:en:news|more...]]</WRAP></WRAP></WRAP>+
  
 +
 +/*
 +[[https://twitter.com/Meiji_Univ_PR/status/1176731063621578753|{{ :iiduka:87214898_639572380209072_1144529439158173696_o.jpg?480 |}}]]
 +*/
 +
 +/* Temporarily Disabled
 +<html><div style="text-align:center"><iframe src="https://www.facebook.com/plugins/page.php?href=https%3A%2F%2Fwww.facebook.com%2Fiidukanet&tabs=timeline&width=500&height=300&small_header=true&adapt_container_width=true&hide_cover=true&show_facepile=false&appId=772928636127053" width="500" height="300" style="border:none;overflow:hidden" scrolling="no" frameborder="0" allowTransparency="true" allow="encrypted-media"></iframe></div></html>
 +*/
 ===== Postal Address ===== ===== Postal Address =====
 Department of Computer Science\\ Department of Computer Science\\
  • en/default.txt
  • 最終更新: 2023/03/01 11:26
  • by Hideaki IIDUKA