"Industrial Engineering: Key Principles and Paradigms Developed to Date and the Opportunities and Challenges for the Future"
By adapting and applying the advances in physical, mathematical, social and management sciences, Industrial Engineers have played a major role in developing the modern economy and continually advancing our quality of life. Industrial... Read More
This talk is an “eye witness account” of the evolution of nonlinear optimization methods over the last 4 decades. Starting from the early days of simplex-inspired methods, to augmented Lagrangians and interior-points, this talk highlights the need for new active set methods and the opportunities (not challenges) provided by stochasticity. We conclude with a few... Read More
In this talk I will show some very recent results on optimal strategies for betting on individual sequences of binary outcomes, that is betting against a non-stochastic coin. This naturally extends the well-known Kelly strategy to the adversarial domain.
Moreover, I will show some surprising links between betting, online learning, and adaptive stochastic... Read More
In this talk we present an asynchronous multistart algorithm for identifying high-quality local minima. We highlight strong theoretical results that limit the number of local optimization runs under reasonable assumptions. Though the results are valid whether or not the derivative of the objective function exists, the method's efficient use of previously evaluated... Read More
All are welcome to attend! Come and ask questions to the best in the field!
Our Advisory Council Members include:
Ray Hoving '69, '71G - Formerly of Bernard Hodes Group
Richard Simek '94, '95G - Hypertherm, Inc.
Karen LaRochelle '99 - LaRochelle Advisors
Ray Pressburger '05 - Accenture
Kathleen Taylor '87 - Johnson & Johnson... Read More
ADMM algorithms have been applied to a variety of problems in the last few years due in part to: the simplicity of the iteration and the ability to exploit problem structure. In this talk, we present an ADMM algorithm for the class of convex quadratic programs (QPs) that arise in the context of Model Predictive Control (MPC) applications. Our convergence analysis... Read More
Over the last several years I have developed a variety of algorithms for faster solution of mixed-integer linear programs, based on a number of insights about branch and bound methods. The seminar will review the insights, the resulting algorithms, and their experimental validation. Topics will include (i) active constraint branching, (ii) branching to force change, (... Read More
Computational Progress in Linear and Mixed Integer Programming
We will look at progress in Linear Programming (LP) and Mixed Integer Programming (MIP) software over the last 25 years. As a result of this progress, modern LP codes are capable of robustly and efficiently solving instances with multiple millions of variables... Read More