报告题目：treating cardinality constraint within the framework of interval branch and bound for solving the best subset selection problem
主 讲 人：min sun 教授
单 位：阿拉巴马大学（美国）
时 间：2024年6月14日 16:00
地 点：学院一楼报告厅
摘 要：many real-world problems in natural science, engineering, statistics, social sciences, and economics can be modeled as continuous global optimization problems. sometimes, problems would also require us to choose only a handful of parameters from a large number of available parameters, resulting in a cardinality-constrained optimization problem. cardinality-constraint is often conveniently treated indirectly through special penalty functions. well-known examples of such indirect approach include ridge regression (l2-penalty), lasso (l1-penalty), and elastic net (l1-l2 mixed penalty). cardinality-constraint can also be treated directly to ensure that only a desired small number of parameters are selected in the final optimal solution. penalty based indirect approach allows almost all existing optimization techniques to be applicable immediately. however, conventional interval branch and bound (ibb) methods do not accept the cardinality-constraint. in this talk, we use the best subset selection (bss) problem as an example to discuss how the framework of ibb could be modified to accommodate the cardinality-constraint. bss is a classical problem in statistics that requires choosing a subset from a larger number of available variables to be included in the model which minimizes the residual sum of squares in the linear regression. ibb is a well-known method to solve global optimization problems even when the feasible set is non-convex. we modified main features of the ibb to treat the cardinality-constraint effectively. the resulting algorithm gives a procedure to enumerate all the candidate solutions and discard the sub-optimal solutions by using deletion conditions to finally locate an optimal solution. we also talk about some related optimal and suboptimal algorithms. finally we report some results of numerical experiments to validate the effectiveness of our methods for solving bss problem.
简 介：dr. min sun is a full professor of department of mathematics in the university of alabama. dr. sun obtained his ph.d. in applied mathematics from wayne state university in 1987. dr. sun’s research areas are global optimization, optimal control, minimax and game, multi-objective programming, modeling and simulation with applications in smart and autonomous home energy managements, water resources management, magnetic materials research, and traffic managements. research results have been published in a variety of international scientific journals in several different areas.