报告简介：
Feasibility is a fundamental issue in the field of both continuous optimization and discrete optimization, no matter whether the problem is feasible or not feasible. Even if the optimization problem is feasible, state-of-the-art solvers have to deal with infeasible subproblems and may generate infeasible cluster points. In this talk, I shall summarize recent advances on optimization with least constraint violation and related applications and give some discussions.

主讲人简介：
戴