Tuesday, November 27, 2018 - 4:00pm
Packing and Covering

The set covering problem is a fundamental model in combinatorial optimization. A basic but difficult question is to... Read More

Tuesday, November 13, 2018 - 4:00pm
Momentum Acceleration Under Random Gradient Noise: From Convex to Non-Convex Optimization



For many large-scale optimization and... Read More

Tuesday, October 30, 2018 - 4:00pm
Reinforcement Learning: Connections Between MDPs and MAB Problems

This talk considers the basic... Read More

Tuesday, October 2, 2018 - 4:00pm
Nonsmooth, Nonconvex Optimization: Algorithms and Examples


In many applications one wishes to minimize an objective function that is not convex and is not differentiable at its minimizers. We discuss two... Read More

Friday, August 10, 2018 - 8:00am

This year the annual MOPTA conference will be combined with an NSF-TRIPODS sponsored three day summer school for doctoral students and the NSF-DIMACS sponsored workshop on Optimization in Machine Learning which is a part of the DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization.

... Read More
Tuesday, May 8, 2018 - 4:00pm
Structure is all that you need - Learning Compressed RL Policies Via Orthogonal Gradient Sensing


We present a new method of blackbox optimization via gradient sensing with the use of structured... Read More

Thursday, May 3, 2018 - 2:30pm

Schedule of Events Spencer C. Schantz Lecture and 50th Anniversary Symposium (celebrating 50 years of the Ph.D. program) Featuring two talks, a panel discussion and the Spencer C. Schantz Lecture by Mikell Groover Time: 2:30 p.m. - 5:00 p.m. Location: Wood Dining Room, Iacocca Hall, 111 Research Dr, Bethlehem, PAISE Cocktail Reception Time: 5:00 p.m. - 6:00 p.m. ... Read More

Tuesday, May 1, 2018 - 4:00pm
Assessing Solution Quality in Stochastic Optimization with Limited Data



We study methods to assess the optimality gap, as a measurement of the quality of solutions, in stochastic... Read More

Tuesday, April 24, 2018 - 4:00pm
A Simple Nearly-Optimal Restart Scheme for Speeding-Up First Order Methods


We present a simple restart scheme for speeding-up first order methods for convex optimization problems. Restarts are made based... Read More

Thursday, April 19, 2018 - 4:00pm
Investigating Polyhedra by Oracles


A software for analyzing the structures of polyhedra that are implicitly defined by optimization oracles.