3篇
您的检索式：作者名="NESTEROV Yurii"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Generalized power method for sparse principal com-ponent analysis 显示文摘 | JOURNEE Michel NESTEROV Yurii SEPULCHRE Rodol-phe | 2010 | The Journal of Machine Learning Re-search2010，11，3： | 1 |
| 2 | On the Accuracy of the Ellipsoid Norm Approximation of the Joint Spectral Radius显示文摘 | Theys Jacques Blondel Vincent Nesterov Yurii | 2005 | Linear Algebra and Its Applications2005，394，： | 1 |
| 3 | Computation of Fisher–Gale Equilibrium by Auction显示文摘We study the Fisher model of a competitive market from the algorithmic perspective.For that,the related convex optimization problem due to Gale and Eisenberg(Ann Math Stat 30(1):165–168,1959)is used.The latter problem is known to yield a Fisher equilibrium under some structural assumptions on consumers’utilities,e.g.,homogeneity of degree 1,homotheticity.Our goal is to examine applicability of the convex optimization framework by departing from these traditional assumptions.We just assume the concavity of consumers’utility functions.For this case,we suggest a novel concept of Fisher–Gale equilibrium by using consumers’utility prices.The prices of utility transfer the utility of consumption bundle to a common numéraire.We develop a subgradient-type algorithm from Convex Analysis to compute a Fisher–Gale equilibrium via Gale’s approach.In order to decentralize prices,we additionally implement the auction design,i.e.,consumers settle and update their individual prices and producers sell at the highest offer price.Our price adjustment is based on a tatonnement procedure,i.e.,the prices change proportionally to consumers’individual excess supplies.Historical averages of consumption are shown to clear the market of goods.Our algorithm is justified by a global rate of convergence.In the worst case,the number of price updates needed to achieve anε-tolerance is proportional to 1/ε^(2). | Yurii Nesterov Vladimir Shikhman | 2018 | Journal of the Operations Research Society of China2018，6，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员