Agenda - April 18 to 20

PRESENTER

TIME

TITLE

Robert Mifflin
Washington State University

8:30 AM

A First Step in Designing a VU-algorithm for Nonconvex Minimization

Jong-Shi Pang
University of Illinois

John Mitchell
Rensselaer Polytechnic Inst.

9:00 AM

Competitive Resource Allocation, QPCCs:  A progress report

Stephen Vavasis
University of Waterloo

9:30 AM

Efficient Algorithms for Large-Scale Convex Optimization

10:00 AM

BREAK

Darrell Whitley, Adele Howe
Colorado State University

10:30 AM

Exploiting Elementary Landscape Analysis to Improve Search on NP-Hard Problems

Tamás Terlaky
Lehigh 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 Scheinberg
Lehigh University

12:00 PM

Recovering Sparse Hessian Structure and Using Random Models in Derivative-Free Optimization

12:30 PM

LUNCH

Sheldon Jacobson
University of Illinois

2:00 PM

Sequential Stochastic Assignment Problems: Dependency and Uncertainty

Pavlo Krokhmal
University of Iowa

2:30 PM

Probabilistic Analysis of Multidimensional Assignment Problems

Kevin Wood
Naval Postgraduate School

3:00 PM

Game Theoretic Search and Detection

3:30 PM

BREAK

Eduardo Pasiliao
Air Force Research Laboratory

4:00 PM

Particle Filters and Assignment Problems for Target Tracking

Oleg Prokopyev
University of Pittsburgh

4:30 PM

Irregular Polyomino Tiling via Integer Programming

K. Subramani
West Virginia University

5:00 PM

Bounded Error Approximation Algorithms for Risk-Based Intrusion Response

5:30 PM

ADJOUR

PRESENTER

TIME

TITLE

Michael Ferris, Stephen Robinson
University of Wisconsin

8:30 AM

Expanding the Reach of Nonlinear Optimization

Robert Freund, Jaime Peraire
MIT

9:00 AM

Recent Research on Design Optimization of Wave Propagation in Metamaterials

J. Eckstein, A. Ruszczyński
Rutgers

9:30 AM

Coherent Risk-Adjusted Decisions over Time: a Bilevel Programming Approach

10:00 AM

BREAK

Warren Powell
Princeton University

10:30 AM

Optimal Learning and Approximate Dynamic Programming for High-Dimensional Stochastic Search and Control

Peter Frazier
Cornell University

11:00 AM

New One-Step Bayes-Optimal Algorithms for Global Optimization: Parallel Computing and Common Random Numbers

Johannes Royset
Naval Postgraduate School

Terry Rockafellar
University of Washington

11:30 AM

Optimal Budget Allocation for Sample Average Approximation

Stan Uryasev
University of Florida

12:00 PM

New Developments in Uncertainty: Linking Risk Management, Reliability, Statistics and Stochastic Optimization

12:30 PM

LUNCH

Shabbir Ahmed
Georgia Tech

2:00 PM

Deterministic Formulations of Probabilistic Set Covering Problems

John Hooker
Carnegie-Mellon University

2:30 PM

Alternative Methods for Obtaining Optimization Bounds

Ergun Ozlem, G. Nemhauser
Georgia Tech

3:00 PM

Solving IPs and Improving Bounds by Restricting and Relaxing Formulations

3:30 PM

BREAK

Christos Cassandras
Boston University

4:00 PM

A Dynamic Optimization Approach for Persistent Search Problems

Steve Marcus, Michael Fu, Jiaqiao Fu
University of Maryland

4:30 PM

Some Recent Research in Simulation Optimization

Suvrajeet Sen
Ohio State University

5:00 PM

Dynamic Stochastic Mixed-Integer Programming Algorithms

5:30 PM

ADJOURN

PRESENTER

TIME

TITLE

Gerald Brown
Naval Postgraduate School

8:30 AM

Evaluating Mission Assurance for Andersen AFB, Guam

Retsef Levi, Tom Magnanti
MIT

9:00 AM

An Optimization Framework for Air Force Logistics Models

Patrick Jaillet
MIT

9:30 AM

Data-Driven Online And Real-Time Combinatorial Optimization

10:00 AM

BREAK

Piyush Kumar
Florida State University

10:30 AM

Instant Approximate 1-center on Roads

Sergiy Butenko
Texas A&M University

11:00 AM

Clique Relaxation Models in Network Analysis

Dursun Bulutoglu
Air Force Institute of Tech.

11:30 AM

Finding GMA Orthogonal Arrays by Enumeration

Alfredo Garcia
University of Virginia

12:00 PM

Speeding Up the Cross Entropy Method for Global Optimization

12:30 PM

ADJOURN