1![](/pdf-icon.png) | Add to Reading ListSource URL: convex.ipa.or.id- Date: 2018-04-27 07:37:36
|
---|
2![Statistical Performance of Convex Tensor Decomposition Ryota Tomioka† Taiji Suzuki† Department of Mathematical Informatics, The University of Tokyo Statistical Performance of Convex Tensor Decomposition Ryota Tomioka† Taiji Suzuki† Department of Mathematical Informatics, The University of Tokyo](https://www.pdfsearch.io/img/f613db54832c0e5f7a2afe53381eff20.jpg) | Add to Reading ListSource URL: tomioka.dkLanguage: English - Date: 2017-08-10 12:21:48
|
---|
3![ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi](https://www.pdfsearch.io/img/1aa2dea923ccbb83ddbcd78785f24b75.jpg) | Add to Reading ListSource URL: homepages.cwi.nlLanguage: English - Date: 2011-06-06 01:41:37
|
---|
4![A Lower Bound for the Optimization of Finite Sums A. Optimization of a strongly convex smooth functions The most accessible derivation of this classic lower bound (Nesterov, 2004) relies on the simplifying assumption th A Lower Bound for the Optimization of Finite Sums A. Optimization of a strongly convex smooth functions The most accessible derivation of this classic lower bound (Nesterov, 2004) relies on the simplifying assumption th](https://www.pdfsearch.io/img/08c336fac8f0f688db45c2d5000ecdbc.jpg) | Add to Reading ListSource URL: proceedings.mlr.pressLanguage: English - Date: 2017-05-06 17:27:03
|
---|
5![Convex Tensor Decomposition via Structured Schatten Norm Regularization Ryota Tomioka Toyota Technological Institute at Chicago Chicago, IL 60637 Convex Tensor Decomposition via Structured Schatten Norm Regularization Ryota Tomioka Toyota Technological Institute at Chicago Chicago, IL 60637](https://www.pdfsearch.io/img/3479547384eefeb375e307e8c043aa93.jpg) | Add to Reading ListSource URL: tomioka.dkLanguage: English - Date: 2017-08-10 12:21:48
|
---|
6![Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is](https://www.pdfsearch.io/img/bf9e15f822f6b45e9aa328e766d8d7a3.jpg) | Add to Reading ListSource URL: www.comp.tmu.ac.jpLanguage: English - Date: 2016-05-09 03:17:31
|
---|
7![Linearly Constrained Convex Programming with Python October 14, 2017 1 Linearly Constrained Convex Programming with Python October 14, 2017 1](https://www.pdfsearch.io/img/e35868cd70db88925dbe82604244af6e.jpg) | Add to Reading ListSource URL: www.shanshu.aiLanguage: English - Date: 2018-07-19 05:09:01
|
---|
8![610 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 58, NO. 3, MARCH 2013 Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets 610 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 58, NO. 3, MARCH 2013 Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets](https://www.pdfsearch.io/img/7d3b3cf5bdfe9473d5037edd5cfbc93e.jpg) | Add to Reading ListSource URL: users.cecs.anu.edu.auLanguage: English - Date: 2013-02-25 09:52:16
|
---|
9![How elegant modern convex analysis was influenced by Moreau’s seminal work. Samir ADLY University of Limoges, France How elegant modern convex analysis was influenced by Moreau’s seminal work. Samir ADLY University of Limoges, France](https://www.pdfsearch.io/img/72294a6dba907cb2a14321393183a3da.jpg) | Add to Reading ListSource URL: www.unilim.fr- Date: 2014-07-21 12:57:21
|
---|
10![Information Complexity of Black-Box Convex Optimization: A New Look Via Feedback Information Theory Information Complexity of Black-Box Convex Optimization: A New Look Via Feedback Information Theory](https://www.pdfsearch.io/img/b7e711cb9463c4f47aa40b59cc78b14f.jpg) | Add to Reading ListSource URL: maxim.ece.illinois.eduLanguage: English - Date: 2012-04-18 12:07:58
|
---|