by Alexander Borek ç´300å¹´åã«ç©çå¦è ã®ã¢ã¤ã¶ãã¯ã»ãã¥ã¼ãã³ãèæ¡ããããã¥ã¼ãã³æ³ãã¯ãç¾ä»£ã§ãç©æµãéèå·¥å¦ãã³ã³ãã¥ã¼ã¿ãã¸ã§ã³ãç´ç²æ°å¦ãªã©å¤å²ã«ãããåéã§éè¦ãªå½¹å²ãæããã¦ããã¢ã«ã´ãªãºã ã§ããããã¾ã§ãã¾ãã¾ãªæ°å¦è ããã®ãã¥ã¼ãã³æ³ã®æ¹è¯ã«è¦å¿ãã¦ãããè¿å¹´ã®ç ç©¶ã§ã¤ãã«ã¢ãããã¼ããããã¨ç§å¦ç³»ãã¥ã¼ã¹ãµã¤ãã®Quanta Magazineãç´¹ä»ãã¦ãã¾ãã Implementable tensor methods in unconstrained convex optimization | Mathematical Programming https://link.springer.com/article/10.1007/s10107-019-01449-1 Three Hundred Years Later, a Tool from Isaa


{{#tags}}- {{label}}
{{/tags}}