[经济学模型] INFORMATION-BASED COMPLEXITY OF CONVEX PROGRAMMING [推广有奖]

0关注
4粉丝

已卖：708份资源

博士生

76%

还不是VIP/贵宾

威望: 0 级
论坛币: 9860 个
通用积分: 40.9055
学术水平: 20 点
热心指数: 5 点
信用等级: 10 点
经验: 4379 点
帖子: 80
精华: 0
在线时间: 465 小时
注册时间: 2017-8-17
最后登录: 2026-1-5

楼主

jinshunwu 发表于 2017-9-3 00:39:00 |AI写论文

是否 +2 论坛币

k人参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

TECHNION - THE ISRAEL INSTITUTE OF TECHNOLOGY
FACULTY OF INDUSTRIAL ENGINEERING & MANAGEMENT

Contents:
Introduction: problem complexity and method efficiency in optimization
Methods with linear dimension-dependent convergence
from bisection to the cutting plane scheme
how to divide a n-dimensional pie: the Center-of-Gravity method
the Outer Ellipsoid method
polynomial solvability of Linear Programming
the Inner Ellipsoid method
convex-concave games and variational inequalities with monotone operators。

动态规划很好的讲义。