Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Program per Time Slot Room Invited Talks - Monday 11:00 AM – 12:00 AM Auditorium On the relationship between machine learning and optimization, Organizer: Michel Goemans, session 552 PLENARY Build Symph H, Z 0 Gambetta 1x60 min Francis Bach, On the relationship between machine learning and optimization Room Invited Talks - Monday 1:30 PM – 2:30 PM Auditorium Multiobjective Optimization with PDE Constraints, Organizer: Stephen J Wright, session 550 SEMI Build Symph H, Z 0 Gambetta 1x60 min Michael Hinterm¨uller, Multiobjective Optimization with PDE Constraints SIGALAS What’s happening in nonconvex optimization? A couple of stories, Organizer: Jean-Baptist Hiriart-Urruty, session 536 KEYNOTE Build C, Z 2 2nd floor 1x60 min Emmanuel Candes, What’s happening in nonconvex optimization? A couple of sto- ries DENIGES Theoretical Analysis of Cutting-Planes in IP Solvers., Organizer: Gerard Cornuejols, session 538 KEYNOTE Build C, Z 5 Ground Floor 1x60 min Santanu Dey, Theoretical Analysis of Cutting-Plane Selection in IP Solvers. Room Discrete Optimization & Integer Programming - Monday 3:15 PM – 4:45 PM Salle 43 Provable guarantees for Cut Generating Functions, Organizer: Amitabh Basu, session 220 IPtheory Build C, Z 1 3rd floor 3x30 min Joseph Paat, Using the geometry of S-free sets to find mixed-integer cut-generating functions Sriram Sankaranarayanan, Can cut gener- ating functions be good and e fficient? Amitabh Basu, Optimal cutting planes from the group relaxations Salle 44 IP Practice I, Chair: Maurice Queyranne, session 506 IPpractice Build C, Z 1 3rd floor 3x30 min Raphael Hauser, IP models for dimension- ality reduction and feature selection in cat- egorical da Carlos Cardonha, Network models for multiobjective discrete optimization Maurice Queyranne, Optimum Turn- Restricted Paths, Nested Compatibility, and Optimum Convex Polygons Salle 39 Exact Optimization Algorithms for Compressed Sensing, Organizer: Marc E Pfetsch, session 56 MINLP Build E, Z 1 3rd floor 3x30 min Christoph Brauer, A primal-dual homo- topy algorithm for sparse recovery with inf. norm constraints Andreas Tillmann, SparkMIP: Mixed- Integer Programming for the (Vector) Ma- troid Girth Problem Frederic Matter, Complex-valued 0 min- imization problems with constant modulus constraints Salle 34 Tight relaxations in nonconvex MINLP, Organizer: Ambros Gleixner, session 128 MINLP Build B, Z 3 1st floor 3x30 min Emily Speakman, Using mixed volume the- ory to compute convex hull volume for tri- linear monomials Stefan Vigerske, Revising the handling of nonlinear constraints in SCIP Ambros Gleixner, Two-dimensional Pro- jections for Separation and Propagation of Bilinear Terms Salle 35 MINLP methods in gas transport optimization (I), Organizer: Lars Schewe, session 162 MINLP Build B, Z 4 Intermediate 3x30 min Lars Schewe, MIP techniques for insta- tionary gas transport optimization and gas market models Nick Mertens, Solving MINLPs by Simul- taneous Convexification with Application to Gas Networks Falk Hante, Complementarity-Based Nonlinear Programming Techniques for Optimal Mixing in Gas LEYTEIRE Geometry of Polynomials and Applications in Approximate Counting, Organizer: Shayan Oveis Gharan, session 99 APPROX Build E, Z 1 3rd floor 3x30 min Guus Regts, On a conjecture of Sokal on the location of roots of the independence polynomial Piyush Srivastava, Zeros of polynomials and Ising partition functions Nima Anari, A Deterministic Approxima- tion Algorithm for Counting Bases of Ma- troids Salle 36 Matching and Matroids, Organizer: José A Soto, session 341 APPROX Build B, Z 4 Intermediate 3x30 min Maximilien Burq, Maximizing Efficiency in Dynamic Matching Markets Morteza Zadimoghaddam, Online Weighted Matching: Beating the 1 /2 Barrier Jos´e Soto, Strong Algorithms for the Ordi- nal Matroid Secretary Problem SIGALAS On the Tree Augmentation Problem, Organizer: Laura Sanità, session 240 COMB Build C, Z 2 2nd floor 3x30 min David Adjiashvili, Beating Approximation Factor 2 For Weighted Tree Augmentation With Bounded Costs Jochen Koenemann, Improved Approxima- tion for Tree Augmentation via Chvatal Gomory Cuts Rico Zenklusen, Improved Approxima- tion for Tree Augmentation: Saving by Rewiring Salle 41 Scheduling with setup, uncertainty and precedences, Organizer: Monaldo Mastrolilli, session 419 COMB Build C, Z 1 3rd floor 3x30 min Kim-Manuel Klein, Empowering the Configuration-IP Nicole Megow, Scheduling under Ex- plorable Uncertainty Jose Verschae, Min-sum scheduling under precedence constraints DURKHEIM Global Optimization, Organizer: Hassan Hijazi, session 299 CP Build A, Z 1 3rd floor 3x30 min Adam Ouorou, A class of proximal al- gorithms based on Chebychev centers for nonsmooth convex o Kaarthik Sundar, Convex relaxations for Mixed-Integer Multilinear Functions Tillmann Weisser, Sparse Certificates for Polynomial Optimization 69 Room Optimization under Uncertainty - Monday 3:15 PM – 4:45 PM Salle 32 Scenario discretization techniques in stochastic optimization, Organizer: Fabian Bastin, session 287 Stoch Build B, Z 5 Ground Floor 3x30 min Thuy Anh Ta, On a two-stage stochastic optimization problem with stochastic con- straints Julien Keutchayan, Multistage stochastic optimization: discretization of probability distributions Michel Gendreau, Effective Heuristics for the Short-Term Hydro-Generation Plan- ning Problem DENIGES Preference robust optimization, Organizer: Erick Delage, session 166 Robust Build C, Z 5 Ground Floor 3x30 min William Haskell, Robust choice with multi-attribute quasi-concave choice func- tions Jonathan Li, Optimizing aspirational pref- erences when the choice of a measure is ambiguous Erick Delage, Utility-based Shortfall Risk Models when Preference Information is In- complete Salle 33 Distributionally Robust Optimization - New Theory and Applications, Organizer: Zhichao Zheng, session 356 Robust Build B, Z 5 Ground Floor 3x30 min Yini Gao, Data-Driven Bounded Rational- ity in Games- A Robust Framework Cagil Kocyigit, Distributionally Robust Mechanism Design Zhichao Zheng, Schedule Reliability in Liner Shipping by Distributionally Robust Optimization Salle 31 Approximate dynamic programming, Organizer: David Brown, session 159 Markov Build B, Z 5 Ground Floor 3x30 min Martin Haugh, Information Relaxation Bounds for Partially Observed Markov De- cision Processes Huseyin Topaloglu, Approximate Dy- namic Programming for Dynamic Assort- ment Optimization David Brown, Approximations to Stochas- tic Dynamic Programs via Information Re- laxation Duality Salle 30 Risk and Energy Markets, Chair: Julio Deride, session 376 Game Build B, Z 5 Ground Floor 3x30 min Olivier Huber, On solving risk-averse equilibrium problems via reformulations Henri Gerard, On risk averse competitive equilibrium Julio Deride, Stochastic General Equilib- rium Model with Application to Energy Markets Room Continuous Optimization - Monday 3:15 PM – 4:45 PM GINTRAC Polynomial and tensor optimization I, Organizer: Jiawang Nie, session 5 NLP Build Q, Z 8 Ground Floor 3x30 min Jean Lasserre, Sparse Polynomial Inter- polation: Compressed Sensing, Super- resolution, or Prony? Stephane Gaubert, Eigenvalues inequali- ties for nonnegative tensors and their trop- ical analogues Harm Derksen, Signal Denoising, Tensors and Singular Values Salle 05 Convex regularization and inverse problems, Organizer: Pierre Weiss, session 216 NLP Build Q, Z 11 1st floor 3x30 min Vincent Duval, T-systems for super- resolution microscopy Frederic De Gournay, Convex regularisa- tion, sparsity and representation theorem Jonas Kahn, Bounds on the size of polye- dral cones Salle KC7 Sparse Recovery, Chair: Mustafa C Pinar, session 432 NLP Build K, Z 10 Intermediate 2 3x30 min John Chinneck, LP-based Sparse Solutions Revisited Mustafa Pinar, Sparse Recovery and Con- vex Quadratic Splines Olof Troeng, Efficient 0 Trend Filtering Salle 8 Nonconvex Optimization: Theory and Methods - Part 1, Organizer: Shoham Sabach, session 184 NonSmooth Build N, Z 12 4th floor 3x30 min Jerome Bolte, From error bounds to the complexity of first-order descent methods Yakov Vaisbourd, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods Shoham Sabach, Nonconvex Lagrangian- Based Optimization: Schemes and Global Convergence Salle 9 Adaptivity in non smooth optimization, Organizer: Masaru Ito, session 558 NonSmooth Build N, Z 12 4th floor 2x30 min Masaru Ito, An adaptive first order method for weakly smooth and uniformly convex problems Somayya Komal, A Subgradient Algorithm for solving variational Inequality Problem Salle 20 Using SDP relaxations and solving them faster, Organizer: Elisabeth Gaar, session 113 SDP Build G, Z 6 1st floor 3x30 min Samuel Burer, Exact SDPs for a Class of (Random and Non-Random) Noncon- vex QCQPs Nicolo Gusmeroli, SDP Based Solution Methods for Binary Quadratic Problems Yuzixuan Zhu, Sieve-SDP: A simple facial reduction algorithm to preprocess SDPs Salle LC5 Algorithms for nonlinear conic problems, Chair: Takayuki Okuno, session 463 SDP Build L, Z 10 Intermediate 1 3x30 min Leonardo Mito, Augmented Lagrangian for nonlinear SDPs applied to the covering problem Cunlu Zhou, Long-Step Path-Following Algorithm for Nonlinear Symmetric Pro- gramming Problems Takayuki Okuno, A primal-dual path fol- lowing method for nonlinear semi-infinite SDPs Salle 06 Proximal Methods for Structured Problems, Organizer: Ting Kei Pong, session 147 Variat Build Q, Z 11 1st floor 3x30 min Tianxiang Liu, A successive DC approxi- mation method for nonconvex nonsmooth optimization Man-Chung Yue, Cubic Regularization Revisited: Faster (Local) Rates under Weaker Assumptions Ting Kei Pong, Iteratively reweighted l1 al- gorithms with extrapolation Salle ARNOZAN Algorithms for optimization and variational problems with possibly nonisolated solutions I, Organizer: Andreas Fischer, session 152 Variat Build Q, Z 8 Ground Floor 3x30 min Nico Strasdat, A special complementarity function revisited Alexey Izmailov, Critical solutions of non- linear equations: attraction for Newton- type methods Andreas Fischer, Local attraction of New- ton methods to critical solutions of con- strained systems Salle KC6 Coordinate Descent and Randomized Direct Search Methods, Organizer: Martin Takac, session 211 RandomM Build K, Z 10 Intermediate 1 3x30 min Asu Ozdaglar, When Cyclic Coordinate Descent Outperforms Randomized Coordi- nate Descent El houcine Bergou, Random direct search method for unconstrained smooth mini- mization Dimitri Papageorgiou, Active Metric Learning for Supervised Classification Salle 21 Mixed-integer derivative-free optimization, Chair: Clément Royer, session 80 DerFree Build G, Z 6 Intermediate 3x30 min Andrew Conn, Underlying algorithms and theory to our approach to MINLP without derivatives Delphine Sinoquet, Benchmark of a trust region method for solving black-box mixed-integer problems Ubaldo Garcia Palomares, A unified ap- proach for solving mixed integer Box- Constrained optimization Salle AURIAC Theory and Methods for ODE- and PDE-Constrained Optimization 1, Chair: Carl M Grei ff, session 331 Control Build G, Z 6 1st floor 3x30 min Behzad Azmi, On the Barzilai-Borwein step-sizes in Hilbert spaces Benjamin Horn, Shape Optimization with Stress Constraints for Frictional Contact Problems Carl Greiff, Quadratic programmimg for time-optimal control in di fferentially flat systems 70 Yüklə 23,3 Mb. Dostları ilə paylaş:
|