Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Continuous Optimization - Thursday 5:00 PM – 6:30 PM Salle 05 Polynomial and tensor optimization II, Organizer: Jiawang Nie, session 6 NLP Build Q, Z 11 1st floor 4x20 min Didier Henrion, Computing invariant mea- sures with the Lasserre hierarchy Anwa Zhou, Completely positive tensor re- covery with minimal nuclear value Jo˜ao Gouveia, Phaseless rank of a matrix Xinzhen Zhang, A Complete Semidefinite Algorithm for Detecting Copositive Matri- ces and Tensors Salle KC7 First Order Methods II, Chair: Guillaume Berger, session 437 NLP Build K, Z 10 Intermediate 2 3x20 min Guillaume Berger, Hölder-continuous gradient and first-order approximation accuracy Andersen Ang, Accelerating Nonnegative Matrix Factorization Algorithms using Ex- trapolation Lei Zhao, First-Order Primal-Dual Method for Nonlinear Convex Cone Programs Salle 20 Global Optimization 3, Chair: Jean-Baptist Hiriart-Urruty, session 503 Global Build G, Z 6 1st floor 4x20 min Jaromil Najman, Tighter McCormick re- laxations through subgradient propagation in a BaB framework Simon Boulmier, Nonlinear branch-and- bound improvements for global optimiza- tion Mester Abig´el, JAVA implementation of a modular, population based global opti- mizer package Tiago Montanher, A rigorous MINLP solver using interval unions Salle LC4 E fficient Semismooth Newton Methods for Large Scale Statistical Optimization Problems, Organizer: Defeng Sun, session 123 NonSmooth Build L, Z 9 Intermediate 1 3x30 min Meixia Lin, Efficient sparse Hessian based algorithms for the clustered lasso problem Yangjing Zhang, An efficient algorithm for solving large scale sparse group Lasso problems Defeng Sun, On the efficient computation of the projector over the Birkho ff polytope Salle 8 Di fferent faces of nonsmoothness in optimization, Organizer: Tim Hoheisel, session 212 NonSmooth Build N, Z 12 4th floor 3x30 min Oliver Stein, Global optimization of GSIPs using disjunctive programming Abraham Engle, Superlinear Conver- gence of QN Methods for PLQ Convex- Composite Optimization Tim Hoheisel, Applications of the general- ized matrix-fractional function Salle AURIAC Recent Advances in Conic Programming III, Organizer: Masakazu Muramatsu, session 84 SDP Build G, Z 6 1st floor 4x20 min Makoto Yamashita, A path-following method for semidefinite programming without Slater condition Tang Peipei, A Majorized Newton-CG ALM for Linearly Constrained Convex Programming Yoshio Ebihara, Analysis of Positive Sys- tems by Semidefinite and Copositive Pro- gramming Yuzhu Wang, Acceleration of the Lagrangian-DNN method for a class of QOPs Salle LC5 Using coning programming in problems solving, Chair: Kurt Majewski, session 497 SDP Build L, Z 10 Intermediate 1 4x20 min Vilmar Jefte De Sousa, Linear Relaxation of Maximum k-Cut with Semidefinite- Based Constraints Anja Kuttich, Feedback Controller and Topology Design for uncertain mechanical systems Julie Sliwak, Stabilization of the moment- based approach to prove global optimality for ACOPF Kurt Majewski, Maximum Volume In- scribed Ellipsoids for Specific Absorption Rate Bounds in MRI Salle 06 VU-decomposition techniques for nonsmooth optimization, Organizer: Claudia Sagastizabal, session 158 Variat Build Q, Z 11 1st floor 3x30 min Shuai Liu, An epsilon-VU algorithm with superlinear convergence Claudia Sagastizabal, A derivative-free VU-algorithm for convex finite-max problems Lucas Sim˜oes, A Fast Gradient Sampling- like Method for Solving Nonsmooth Opti- mization Problems Salle ARNOZAN Variational Analysis 5, Organizer: David Sossa, session 371 Variat Build Q, Z 8 Ground Floor 4x20 min Francisco Jara-Moroni, A global-local ap- proach for stochastic programs with com- plementarity constraints Miguel Sama, Conical Regularization of Multiobjective Optimization Problems David Sossa, Complementarity problems with respect to Loewnerian cones Chee Khian Sim, Relaxed Peaceman- Rachford Splitting Method: Convergence Study Salle KC6 Recent Progress on Second-order Type Optimization Methods, Organizer: Andre Milzarek, session 302 RandomM Build K, Z 10 Intermediate 1 3x20 min Ching-pei Lee, Inexact Successive Quadratic Approximation for Regularized Optimization Jiang Hu, Structured Quasi-Newton method For Optimization with Orthogo- nality Constraints Andre Milzarek, A stochastic semis- mooth Newton method for nonsmooth nonconvex optimization Salle 21 Advances in DFO III, Chair: Juan C Meza, session 496 DerFree Build G, Z 6 Intermediate 3x30 min Jan Feiling, Utilizing Non-Commutative Maps in Derivative-Free Optimization Richard Carter, Generalization of DI- RECT algorithm supporting interactive problem redefinition Juan Meza, Pattern Search Methods With Surrogates for Surface Structure Determi- nation 92 Room Specific Models, Algorithms, and Software - Thursday 5:00 PM – 6:30 PM FABRE First-order methods for large-scale convex problems II, Organizer: Stephen A Vavasis, session 318 Learning Build J, Z 8 Ground Floor 4x20 min Madeleine Udell, Convex Low Rank Semidefinite Optimization Simon Lacoste-Julien, Frank-Wolfe Split- ting via Augmented Lagrangian Method Francois Glineur, Extending performance estimation beyond exact convex fixed-step methods Xuan Vinh Doan, Low-Storage Condi- tional Gradient Method for Low-Rank and Sparse Optimization Salle 16 Advances in Reinforcement Learning Algorithms, Organizer: Lin Xiao, session 329 Learning Build I, Z 7 2nd floor 4x20 min Mengdi Wang, Compressive Learning for Sequential Decision Process Shipra Agrawal, Posterior sampling for re- inforcement learning Lihong Li, SBEED learning: Convergent control with nonlinear function approxi- mation Adithya M Devraj, Zap Q-Learning: Fastest Convergent Q-learning Salle 22 Ranking and recommendation, Chair: Aleksandra Burashnikova, session 472 Learning Build G, Z 6 2nd floor 4x20 min Aleksandra Burashnikova, Learning On- line Ranking Models with a Sequential Op- timization Algorithm Ibrahim Muter, Integrating Individual and Aggregate Diversity in Top-N Recommen- dation Engin Tas, A stochastic gradient descent algorithm for learning to rank Jose Dula, The Recommender Problem with Convex Hulls Salle 24 Vehicle Routing III, Chair: Raquel Bernardino, session 413 Logistics Build G, Z 6 3rd floor 3x20 min Raquel Bernardino, A hybrid algorithm for the family traveling salesman problem Roghayeh Hajizadeh, Snow removal: Modeling and bounds by relaxation, heuristic and branch-and-bound Vitor Nesello, Column Generation Based Local Search for Pickup-and-Delivery problems Salle 18 Supply Chain, Chair: Daniel Ramón-Lumbierres, session 533 Scheduling Build I, Z 7 1st floor 4x20 min Wei Huang, Using SAP Integrated Busi- ness Planning to Optimize Supply Chain Florian Fontan, Complexity of processing-time dependent profit maxi- mization scheduling problems Abdessamad Ouzidan, Modelization and optimization of inventory management for palletization Daniel Ram´on-Lumbierres, A multistage stochastic programming model for the strategic supply chain design Salle DENUCE Equilibrium and Optimization in Energy Markets, Organizer: Asgeir Tomasgard, session 151 Energy Build Q, Z 8 Ground Floor 3x30 min Steven Gabriel, Bilevel Linear Program- ming Investment Problems Lower-Level Primal and Dual Variables Endre Bjorndal, The Flow-Based Mar- ket Coupling Model and the Bidding Zone Configuration Asgeir Tomasgard, A European power market model with short- and long-term uncertainty Salle 23 Gas Network and Market Optimization, Organizer: Jonas Schweiger, session 293 Energy Build G, Z 6 3rd floor 3x30 min Jonas Schweiger, Foresighted decision support for gas network operation Felix Hennings, Controlling complex net- work elements by target values Julia Gr¨ubel, Nonconvex Equilibrium Models for Gas Market Analysis Salle LA4 Medicine and Metabolic engineering, Chair: Mahdi Doostmohammadi, session 396 Sciences Build L, Z 8 Basement 4x20 min Michelle Boeck, Model Predictive Control and Robust Optimization in Adaptive Ra- diation Therapy Bj¨orn Mor´en, Improving a Dose-Volume Model for HDR Brachytherapy to Reduce Tumour Cold Spots Amanda Smith, New bilevel formulations for optimizing flux bounds in metabolic engineering Mahdi Doostmohammadi, MOMO - Multi- Objective Mixed integer Optimisation for metabolic engineering Salle 9 Large-scale combinatorial optimization implementations, Organizer: Aaron Archer, session 96 Algo Build N, Z 12 4th floor 4x20 min Andrew Goldberg, Lost in Translation: Production Code E fficiency Kevin Aydin, Distributed Balanced Parti- tioning via Linear Embedding Christian Schulz, High Quality Graph and Hypergraph Partitioning Hossein Bateni, Solving Coverage Prob- lems on Massive Data PITRES Computational OR in Julia /JuMP, Organizer: Miles Lubin, session 238 Algo Build O, Z 8 Ground Floor 3x30 min Miles Lubin, JuMP 0.19 and MathOptIn- terface: new abstractions for mathematical optimization Sebastien Martin, Optimizing Public Pol- icy: School Transportation and Start Times in Boston. Jarrett Revels, Capstan: Next-Generation Automatic Di fferentiation for Julia Room Invited Talks - Thursday 5:00 PM – 6:30 PM SIGALAS Planning, Chair: Jeanjean Antoine, session 389 INTERFACE Build C, Z 2 2nd floor 4x20 min Jeanjean Antoine, Planning model for recommerce activities Boris Grimm, A Propagation Approach for Railway Rolling Stock Optimization Eric Bourreau, Real Size Exam Timetabling at Montpellier University (France) Mohamed Benkirane, An Hypergraph Model for the Rolling Stock Rotation Plan- ning and Train Selection 93 Yüklə 23,3 Mb. Dostları ilə paylaş:
|