Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Optimization under Uncertainty - Wednesday 5:00 PM – 6:30 PM DENIGES Stochastic Programming and Distributionally Robust Optimization Models with Endogenous Uncertainty, Organizer: Miguel Lejeune, session 248 Stoch Build C, Z 5 Ground Floor 3x30 min Nilay Noyan, Distributionally Robust Op- timization with Decision-Dependent Am- biguity Set Kartikey Sharma, Optimization Under Decision-dependent Uncertainty Miguel Lejeune, Chance-Constrained Op- timization Models with Endogenous and Exogenous Uncertainty Salle 32 Stochastic optimization models and applications, Chair: F.-Javier Heredia, session 495 Stoch Build B, Z 5 Ground Floor 4x20 min Geoffrey Oxberry, Design optimization under uncertainty Gislaine Pericaro, Optimal non- anticipative scenarios for nonlinear hydrothermal power systems Alexander Vinel, A Generalized Risk Par- ity Model with Application for Hazmat Transportation F.-Javier Heredia, A multistage stochastic programming model for the optimal bid of a wind producer Salle 37 Robust Adaptive Control and Learning, Organizer: Siqian Shen, session 97 Robust Build B, Z 4 Intermediate 2x30 min Siqian Shen, Distributionally Robust Adaptive Control under Nonstationary Uncertainty Lauren Steimle, Leveraging stochastic programming to design robust policies for Markov decision Salle 33 Robust combinatorial optimization III, Organizer: Moritz Mühlenthaler, session 255 Robust Build B, Z 5 Ground Floor 4x20 min Moritz M¨uhlenthaler, Robust Matching Augmentation Viktor Bindewald, Solving Bulk-Robust Assignment Problems to Optimality Felix Hommelsheim, Assignment Problems with few Failure Resources Jaehyeon Ryu, Distributionally Robust Chance-Constrained Binary Knapsack Problem Salle 30 Aspects of Multiobjective Combinatorial Optimization, Organizer: Matthias Ehrgott, session 87 Game Build B, Z 5 Ground Floor 3x30 min Serpil Sayin, Generating Representative Sets for Multiobjective Discrete Optimiza- tion Problems Kim Andersen, A multi-objective approach to sensitivity analysis of MILP Fritz B¨okler, Approximating the Multi- objective Shortest Path Problem in Practice Room Continuous Optimization - Wednesday 5:00 PM – 6:30 PM GINTRAC Software for Nonlinear Optimization, Organizer: Sven Ley ffer, session 133 NLP Build Q, Z 8 Ground Floor 3x30 min Charlie Vanaret, Argonot: An Open- Source Software Framework for Nonlinear Optimization Philip Gill, A Primal-Dual Shifted Barrier Method for Nonlinear Optimization Elizabeth Wong, L-RH-B: Software for Large-Scale Bound-Constrained Optimization Salle 05 Conjugate Gradient Methods, Chair: Giovanni Fasano, session 362 NLP Build Q, Z 11 1st floor 3x30 min Mehiddin Al-Baali, A New Diagonaliz- able Conjugate Gradient Method for Un- constrained Optimization Giovanni Fasano, Conjugate Direction Methods and Polarity for Quadratic Hyper- surfaces Luis Lucambio Perez, Non-linear conju- gate gradient for vector optimization on Riemannian manifolds Salle 9 Linear Optimization II, Chair: Julian Hall, session 416 NLP Build N, Z 12 4th floor 3x30 min Julian Hall, Starting the dual revised sim- plex method from an advanced basis Masaya Tano, On the number of simplex iterations of the steepest-edge for a nonde- generate LP Marina Epelman, New Results on the Sim- plex Method for Minimum Cost Flows in Infinite Networks Salle ARNOZAN Interior Point Methods in LP and NLP, Chair: Andre L Tits, session 430 NLP Build Q, Z 8 Ground Floor 3x30 min Andre Tits, Constraint-Reduced MPC for CQP, with a Modified Active Set Identifi- cation Scheme Thiane Coliboro, An IPM approach for a time dependent large-scale assortment al- location problem Ngoc Nguyen Tran, Local analysis of a primal-dual method for NLP without con- straint qualification Salle 8 Methods and Analysis for Nonsmooth Optimization, Organizer: Michael L Overton, session 86 NonSmooth Build N, Z 12 4th floor 3x30 min Michael Overton, Partial Smoothness of the Numerical Radius Adrian Lewis, Partial smoothness and ac- tive sets: a fresh approach Dmitriy Drusvyatskiy, Subgradient meth- ods for sharp weakly convex problems Salle 20 Noncommutative polynomial optimization: semidefinite relaxations, free convexity and applications to quantum information I, Organizer: Monique Laurent, session 20 SDP Build G, Z 6 1st floor 3x30 min Markus Schweighofer, Inclusion of spec- trahedra, free spectrahedra and coin toss- ing Tom-Lukas Kriel, Matrix convex sets and matrix extreme points Janez Povh, Extracting optimisers by non- commutative GNS construction is robust Salle LC5 Completely Positive Cones and Applications, Chair: Patrick Groetzner, session 464 SDP Build L, Z 10 Intermediate 1 4x20 min Muhammad Iqbal, Approximation Hierar- chies for Copositive and Completely Posi- tive Tensor Cones Mina Saee Bostanabad, Inner approximat- ing the completely positive cone via the cone of SDD matrices Ellen Fukuda, Solving nonlinear conic programming problems with a new DC ap- proach Patrick Groetzner, A method to compute factorizations for completely positive ma- trices Salle 06 Complementarity Problems, Organizer: Samir K. Neogy, session 173 Variat Build Q, Z 11 1st floor 3x30 min Muddappa Gowda, Weakly homogeneous variational inequalities Samir Neogy, On testing matrices with nonnegative principal minors Dipti Dubey, Total Dual Integrality and In- tegral Solutions of Linear Complementar- ity Problem Salle KC6 Non-Convex and Second-order Methods in Machine Learning, Organizer: Martin Takac, session 33 RandomM Build K, Z 10 Intermediate 1 4x20 min Aurelien Lucchi, Escaping Saddles with Stochastic Algorithms Reza Babanezhad, Convergence Rate of Expectation-Maximization Francesco Orabona, Parameter-free non- smooth convex stochastic optimization through coin betting Martin Takac, SGD and Hogwild! Con- vergence Without the Bounded Gradients Assumption Salle 21 Progress in methods and theory of derivative-free optimization, Chair: Serge Gratton, session 42 DerFree Build G, Z 6 Intermediate 3x30 min Charles Audet, Mesh-based Nelder-Mead algorithm for inequality constrained opti- mization Jeffrey Larson, Manifold Sampling for Nonconvex Optimization of Piecewise Linear Compositions Morteza Kimiaei, Competitive derivative- free optimization with optimal complexity Salle AURIAC Advances in optimization methods for time dependent problems II, Organizer: Denis Ridzal, session 225 Control Build G, Z 6 1st floor 4x20 min Stefan Ulbrich, Preconditioners for un- steady PDE-constrained optimization and parallel variants Sebastian Goetschel, Parallel-in-time PDE-constrained optimization using PFASST Andreas Potschka, Direct Multiple Shoot- ing for parabolic PDE constrained opti- mization Denis Ridzal, Multigrid-in-time methods for optimization with nonlinear PDE /DAE constraints 84 Yüklə 23,3 Mb. Dostları ilə paylaş:
|