首页 --> 新闻发布 -->正文
Seminar第1664期 A new method for solving the homogeneous feasibility problem

创建日期 2018/6/12 福平   浏览次数  143 返回    
字号:   
 

报告主题: A new method for solving the homogeneous feasibility problem
报告人:Kees Roos 教授 (荷兰 Delft University of Technology)
报告时间:2018年6月14日(周四)13:00
报告地点:校本部G507
邀请人:白延琴教授

报告摘要:Finding a nonnegative nonzero vector in the null space of a matrix is a fundamen-tal problem that arises in many applications. The same holds for its dual problem,which is the problem of finding a positive vector in the row space of a matrix. The first problem is called the Von Neumann problem, after John von Neumann, who proposed the first solution method in a private communication to George Dantzig in 1948; it has been published by Dantzig only in 1992. The second problem is the so-called Perceptron problem. The perceptron models a hypothetical nervous system, or machine, and is designed to illustrate some of the fundamental properties of intelligent systems. Nowadays both problems find much interest in Artificial Intelligence, especiallyin Big Data and Machine Learning. Usually the problems that arise are so large that the standard methods for solving linear optimization problems (like the Sim-plex Method and Interior-Point Methods) fail to work. Therefore the emphasis is currently on the use of cleverly designed first-order methods. In our presentation we fucus on a new method that combines the Mirror-Prox method of Nemirovski and a rescaling method introduced by Chubanov.

欢迎教师、学生参加 !


版权所有 © 上海大学    沪ICP备09014157   地址:上海市宝山区上大路99号(周边交通)   邮编:200444   电话查询
技术支持:上海大学信息化工作办公室   联系我们