Download a PDF version of the agenda.
Download a PDF of the abstract booklet in a 1-column format or 2-column format.
WEDNESDAY, APRIL 18TH
PRESENTER
TIME
TITLE
Robert MifflinWashington State University
8:30 AM
A First Step in Designing a VU-algorithm for Nonconvex Minimization
Jong-Shi PangUniversity of Illinois
John MitchellRensselaer Polytechnic Inst.
9:00 AM
Competitive Resource Allocation, QPCCs: A progress report
Stephen VavasisUniversity of Waterloo
9:30 AM
Efficient Algorithms for Large-Scale Convex Optimization
10:00 AM
BREAK
Darrell Whitley, Adele HoweColorado State University
10:30 AM
Exploiting Elementary Landscape Analysis to Improve Search on NP-Hard Problems
Tamás TerlakyLehigh University
11:00 AM
Mixed Integer Second Order Conic Optimization (MISOCO): Disjunctive Conic Cuts
Charles AudetÉcole Polytechnique de Montréal
11:30 AM
Quadratic and TGP models within the MADS Algorithm for Blackbox Optimization
Katya ScheinbergLehigh University
12:00 PM
Recovering Sparse Hessian Structure and Using Random Models in Derivative-Free Optimization
12:30 PM
LUNCH
Sheldon JacobsonUniversity of Illinois
2:00 PM
Sequential Stochastic Assignment Problems: Dependency and Uncertainty
Pavlo KrokhmalUniversity of Iowa
2:30 PM
Probabilistic Analysis of Multidimensional Assignment Problems
Kevin WoodNaval Postgraduate School
3:00 PM
Game Theoretic Search and Detection
3:30 PM
Eduardo PasiliaoAir Force Research Laboratory
4:00 PM
Particle Filters and Assignment Problems for Target Tracking
Oleg ProkopyevUniversity of Pittsburgh
4:30 PM
Irregular Polyomino Tiling via Integer Programming
K. SubramaniWest Virginia University
5:00 PM
Bounded Error Approximation Algorithms for Risk-Based Intrusion Response
5:30 PM
ADJOUR
THURSDAY, APRIL 19TH
Michael Ferris, Stephen RobinsonUniversity of Wisconsin
Expanding the Reach of Nonlinear Optimization
Robert Freund, Jaime PeraireMIT
Recent Research on Design Optimization of Wave Propagation in Metamaterials
J. Eckstein, A. RuszczyńskiRutgers
Coherent Risk-Adjusted Decisions over Time: a Bilevel Programming Approach
Warren PowellPrinceton University
Optimal Learning and Approximate Dynamic Programming for High-Dimensional Stochastic Search and Control
Peter FrazierCornell University
New One-Step Bayes-Optimal Algorithms for Global Optimization: Parallel Computing and Common Random Numbers
Johannes RoysetNaval Postgraduate School
Terry RockafellarUniversity of Washington
Optimal Budget Allocation for Sample Average Approximation
Stan UryasevUniversity of Florida
New Developments in Uncertainty: Linking Risk Management, Reliability, Statistics and Stochastic Optimization
Shabbir AhmedGeorgia Tech
Deterministic Formulations of Probabilistic Set Covering Problems
John HookerCarnegie-Mellon University
Alternative Methods for Obtaining Optimization Bounds
Ergun Ozlem, G. NemhauserGeorgia Tech
Solving IPs and Improving Bounds by Restricting and Relaxing Formulations
Christos CassandrasBoston University
A Dynamic Optimization Approach for Persistent Search Problems
Steve Marcus, Michael Fu, Jiaqiao FuUniversity of Maryland
Some Recent Research in Simulation Optimization
Suvrajeet SenOhio State University
Dynamic Stochastic Mixed-Integer Programming Algorithms
ADJOURN
FRIDAY, APRIL 20TH
Gerald BrownNaval Postgraduate School
Evaluating Mission Assurance for Andersen AFB, Guam
Retsef Levi, Tom MagnantiMIT
An Optimization Framework for Air Force Logistics Models
Patrick JailletMIT
Data-Driven Online And Real-Time Combinatorial Optimization
Piyush KumarFlorida State University
Instant Approximate 1-center on Roads
Sergiy ButenkoTexas A&M University
Clique Relaxation Models in Network Analysis
Dursun BulutogluAir Force Institute of Tech.
Finding GMA Orthogonal Arrays by Enumeration
Alfredo GarciaUniversity of Virginia
Speeding Up the Cross Entropy Method for Global Optimization