Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Optimization under Uncertainty - Tuesday 8:30 AM – 10:30 AM DENIGES Risk-averse stochastic programming, Organizer: Andrzej Ruszczynski, session 252 Stoch Build C, Z 5 Ground Floor 4x30 min Darinka Dentcheva, Asymptotics of stochastic optimization problems with composite risk functionals Ozlem Cavus, Multi-objective risk-averse two-stage stochastic programming prob- lems Alexander Shapiro, Distributionally ro- bust stochastic programming Andrzej Ruszczynski, Risk Disintegration with Application to Partially Observable Systems Salle 37 Nonlinear Optimization with Uncertain Constraints, Organizer: Charlie Vanaret, session 110 Robust Build B, Z 4 Intermediate 3x30 min Andreas Waechter, Nonlinear program- ming reformulations of chance constraints (Part 2) Alejandra Pena-Ordieres, Nonlinear pro- gramming reformulations of chance con- straints (Part 1) Sven Leyffer, Sequential Linearization for Nonlinear Robust Optimization Salle 33 Robust Optimization and Operations Mangement, Organizer: Chaithanya Bandi, session 410 Robust Build B, Z 5 Ground Floor 3x30 min Nikos Trichakis, Robustness of Static Pricing Policies in the Face of Strategic Customers Omar Besbes, Prior-Independent Optimal Auctions Chaithanya Bandi, Design and Control of Multi-class Queueing Networks via Robust Optimization Salle 31 Algorithms for stochastic games : new approaches, Organizer: Hugo Gimbert, session 137 Markov Build B, Z 5 Ground Floor 4x30 min Marcin Jurdzinski, Quasi-polynomial al- gorithms for solving parity games Antonin Kucera, One-Counter Stochastic Games with Zero-Reachability Objectives Marcello Mamino, Around tropically con- vex constraint satisfaction problems. Mateusz Skomra, The condition number of stochastic mean payo ff games Salle 30 Algorithmic Game Theory I, Organizer: Luce Brotcorne, session 311 Game Build B, Z 5 Ground Floor 4x30 min Victor Bucarey, Solving Strong Stackel- berg Equilibrium in Stochastic Games Fr¨ank Plein, Models for the single-minded bundle pricing problem Concepcion Dominguez, Branch-and-cut algorithm for the Rank Pricing problem Yury Kochetov, A matheuristic for the bilevel 0-1 public-private partnership prob- lem Room Continuous Optimization - Tuesday 8:30 AM – 10:30 AM GINTRAC Stochastic and Nonlinear Optimization I, Organizer: Jorge Nocedal, session 47 NLP Build Q, Z 8 Ground Floor 4x30 min Raghu Bollapragada, A Progressive Batching L-BFGS Method for Machine Learning Leon Bottou, Convexity "à la carte" Philip Thompson, On variance reduction for stochastic optimization with multi- plicative noise Frank Curtis, Characterizing Worst-Case Complexity of Algorithms for Nonconvex Optimization Salle 05 Machine learning and sparse optimisation , Organizer: Coralia Cartis, session 109 NLP Build Q, Z 11 1st floor 4x30 min Martin Lotz, Condition numbers and weak average-case complexity in opti- mization Armin Eftekhari, A Long (Random) Walk Solves All Your (Linear) Problems Florentin Goyens, Manifold lifting: prob- lems and methods Jared Tanner, Sparse non-negative super- resolution: simplified and stabilized Salle KC7 Unconstrained Optimization, Chair: Ekkehard Sachs, session 401 NLP Build K, Z 10 Intermediate 2 4x30 min Andrea Caliciotti, SYMMBK algorithm applied to Newton-Krylov methods for un- constrained optimization Elisa Riccietti, Regularizing trust-region methods for ill-posed nonlinear least- squares problems Massimo Roma, Approximate Inverse Pre- conditioning for Newton-Krylov methods Ekkehard Sachs, Second Order Adjoints Salle LC4 Advances in Bundle Methods for Convex Optimization, Organizer: Christoph Helmberg, session 93 NonSmooth Build L, Z 9 Intermediate 1 4x30 min Frank Fischer, An Asynchronous Parallel Bundle Method Based on Inexact Oracles Antonio Frangioni, Fully Incremen- tal Bundle Methods: (Un)cooperative (Un)faithful Oracles and Upper Elisabeth Gaar, The Bundle Method for Getting an Improved SDP Relaxation of the Stability Number Christoph Helmberg, A Dynamic Scaling Approach for Bundle Methods in Convex Optimization Salle 8 Addressing problems with complex geometries, Organizer: Edouard Pauwels, session 229 NonSmooth Build N, Z 12 4th floor 4x30 min Jerome Malick, Sensitivity analysis for mirror-stratifiable convex functions Courtney Paquette, An accelerated prox- imal method for minimizing compositions of convex functions Antoine Hochart, How to perturb semi- algebraic problems to ensure constraint qualification? Edouard Pauwels, The multiproximal lin- earization method for convex composite problems Salle 20 Algebraic and geometric aspects of semidefinite programming, Organizer: Hamza Fawzi, session 85 SDP Build G, Z 6 1st floor 4x30 min James Saunderson, Certificates of poly- nomial nonnegativity via hyperbolic opti- mization Xavier Allamigeon, Log-barrier interior point methods are not strongly polynomial Amy Wiebe, Slack ideals of polytopes Dogyoon Song, Measuring Optimality Gap in Conic Programming Approximations with Gaussian Width Salle LC5 Theory and algorithms in conic linear programming 1, Organizer: Gabor Pataki, session 88 SDP Build L, Z 10 Intermediate 1 4x30 min Henry Wolkowicz, Low-Rank Matrix Completion (LRMC) using Nuclear Norm (NN) with Facial Reduction Negar Soheili, Solving conic systems via projection and rescaling Henrik Friberg, Projection and presolve in MOSEK: exponential and power cones Levent Tuncel, TOTAL DUAL INTE- GRALITY FOR CONVEX, SEMIDEF- INITE, AND EXTENDED FORMULA- TIONS Salle 06 Nonlinear Optimization and Variational Inequalities V, Organizer: Xin Liu, session 145 Variat Build Q, Z 11 1st floor 4x30 min Yaohua Hu, Lower-order regularization method for group sparse optimization with application Tingting Wu, Solving Constrained TV2L1-L2 MRI Signal Reconstruction via an E fficient ADMM Oleg Burdakov, On solving saddle-point problems and non-linear monotone equa- tions Javad Feizollahi, A first-order method for semidefinite stochastic variational inequal- ity problems Salle ARNOZAN Optmization Algorithms and Variational Inequalites I, Organizer: Bo Jiang, session 148 Variat Build Q, Z 8 Ground Floor 4x30 min Yu-Hong Dai, Smoothing quadratic regu- larization method for the hemivariational inequalities Deren Han, ADMM for Optimization Problems Involving Nonconvex Functions Xingju Cai, ADMM-based methods for monotone inverse variational inequalities Bo Jiang, Vector Transport-Free SVRG with General Retraction for Riemannian Optimization Salle KC6 Larges Scale and Distributed Optimization, Organizer: Ermin Wei, session 214 RandomM Build K, Z 10 Intermediate 1 4x30 min Pontus Giselsson, On Linear Conver- gence for Douglas-Rachford splitting and ADMM Jonathan Eckstein, Block-Iterative and Asynchronous Projective Splitting for Monotone Operators Gesualdo Scutari, Achieving Geomet- ric Convergence for Distributed Asyn- chronous Optimization Ermin Wei, Asynchronous Distributed Network Newton Method Salle 21 Bayesian and Randomized Optimization II, Chair: Youssef Diouane, session 79 DerFree Build G, Z 6 Intermediate 4x30 min Nathalie Bartoli, Adaptive modeling strategy for high-dimensional constrained global optimization Robert Gramacy, Modeling an Aug- mented Lagrangian for Blackbox Con- strained Optimization Victor Picheny, Bayesian optimization un- der mixed constraints Zi Wang, Bayesian Optimization Guided by Max-values Salle AURIAC Optimization Methods for PDE Constrained Problems , Organizer: Michael Ulbrich, session 221 Control Build G, Z 6 1st floor 4x30 min Anton Schiela, An affine covariant com- posite step method with inexact step com- putations Sebastian Garreis, Optimal Control under Uncertainty: Adaptive Solution with Low- rank Tensors Carlos Rautenberg, On the optimal con- trol of quasi-variational inequalities Michael Ulbrich, Inexact bundle methods for nonconvex problems in Hilbert space with applications 74 Yüklə 23,3 Mb. Dostları ilə paylaş:
|