MOSEK is a software package for solving large scale sparse optimization problems. To be precise MOSEK is capable of solving linear, convex quadratic and conic quadratic optimization problems possibly having some integer constrained variables. In addition MOSEK can solve continuous semidefinite optimization problems.

In this presentation we will review what is... Read More

Product and content personalization is now ubiquitous in e-commerce. Available transactional data is typically too sparse for this task. As such, companies today seek to use a variety of information on the interactions between a product and a customer to drive personalization decisions. We formalize this problem as one of recovering a large-scale matrix, with side... Read More

Lehigh’s Industrial and Systems Engineering (ISE) Council will be holding their seventh ISE Career Fair on September 14, 2016, a day before the Lehigh University Career Fair on September 15th. Employers and students will be able to meet in a personal setting that and discuss the company’s internship/co-op/job opportunities! *This event is for both ISE & HSE (... Read More

Thursday, April 28, 2016 - 5:00pm
Please join the ISE Department at the annual ISE Banquet.
A Cocktail Reception will begin at 5:00 p.m. in the Iacocca Hall, Siegel Gallery (Ground Floor) followed by the Banquet Dinner at 6:00 p.m. in Wood Dining Room, Iaccocca Hall.
 ... Read More
Thursday, April 28, 2016 - 4:00pm

Click here to read more about Richard Verma as the recipient of the 2016 ISE Distinguished Alumni Award in Industry


"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