Events

Date: Wednesday, November 29, 2017
Time: 4:00 pm
Title: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. The traveling salesman problem is easy to state: given a number of cities along with the cost of travel between each pair of them, and the cheapest way to visit them all and return to your starting point. Easy... Read More

This talk describes a new class of splitting methods for monotone operator problems developed by the author and P. Combettes. It can solve problems involving any finite number of operators and can operate in an asynchronous parallel manner. It has a unique feature for a decomposition algorithm: it does not need to visit every monotone operator at each iteration. The... Read More

We present a branch-and-cut algorithm for solving discrete bilevel linear programs where the upper-level variables are binary and the lowerlevel variables are either pure integer or pure binary. This algorithm performs local search to find improved bilevel-feasible solutions. We strengthen the relaxed node subproblems in the branch-and-cut search tree by generating... Read More

We present a framework for a class of sequential decision-making problems in the context of max-min bilevel programming, where a leader and a follower repeatedly interact. At each period, the leader allocates resources to disrupt the performance of the follower (e.g., as in defender-attacker or interdiction problems), who in turn minimizes some cost function over a set... Read More

For convex optimization problems deterministic first order methods have linear convergence provided that the objective function is smooth (Lipschitz continuous gradient) and strongly convex. Moreover, under the same conditions – smoothness and strong convexity – stochastic first order methods have sublinear convergence rates. However, in many applications (machine... Read More

This technical talk will show live calculations in Mathematica 11 and other Wolfram technologies relevant to courses and research. Specific topics include:* Visualize data, functions, surfaces, and more in 2D or 3D* Store and share documents locally or in the Wolfram Cloud* Use the Predictive Interface to get suggestions for the next useful calculation or function... Read More

Empirical risk minimization (ERM) problems express optimal classifiers as solutions of optimization problems in which the objective is the sum of a very large number of sample costs. Established approaches to solve ERM rely on computing stochastic gradient directions by accessing a single summand at each iteration. Despite the efficiency of individual iterations, these... Read More

Lehigh’s Industrial and Systems Engineering (ISE) Council will be holding their seventh ISE Career Fair on September 13, 2017, a day before the Lehigh University Career Fair on September 14th. 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

MOPTA aims at bringing together a diverse group of people from both discrete and continuous optimization, working on both theoretical and applied aspects. There will be a small number of invited talks from distinguished speakers and contributed talks, spread over three days. Our target is to present a diverse set of exciting new developments from different optimization... Read More

Please take the opportunity to visit the ISE Department, have a drink with your fellow classmates and professors and meet graduating students! RSVP to aeb213@lehigh.edu if you are planning to stop by!

Pages