Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Optimization under Uncertainty - Monday 5:00 PM – 6:30 PM Salle 32 Distributionally Robust Stochastic Programming: Theory and Applications, Organizer: Ran Ji, session 250 Stoch Build B, Z 5 Ground Floor 3x30 min Yiling Zhang, Ambiguous Chance- constrained Binary Programs Under Mean-covariance Information Karthyek Murthy, Distributionally Ro- bust Optimization with optimal transport (Wasserstein) costs Ran Ji, Distributionally Robust Chance- Constrained Optimization with Wasser- stein Metric Salle 30 Di fferentiability, convexity, and modeling in stochastic optimization, Chair: Kai A. Spuerkel, session 493 Stoch Build B, Z 5 Ground Floor 3x20 min Holger Heitsch, Stochastic optimization with probabilistic /robust (probust) con- straints Pedro Perez-Aros, Subdifferential charac- terization of probability functions Kai Spuerkel, Strong Convexity in Stochastic Programming with Deviation Risk Measures DENIGES Advances in Adjustable Robust Optimization, Organizer: Do Young Yoon, session 350 Robust Build C, Z 5 Ground Floor 3x30 min Dick den Hertog, Robust optimization for models with uncertain SOC and SDP con- straints Ernst Roos, Approximation of uncertain convex inequalities Do Young Yoon, Monitoring with Limited Information Salle 37 New models in robust optimization, Chair: Juan S Borrero, session 459 Robust Build B, Z 4 Intermediate 3x20 min Jaeyoong Lim, On using cardinality con- strained uncertainty for objective coe ffi- cients Philip Kolvenbach, Robust optimization of PDE-constrained problems using second- order methods Juan Borrero, Robust optimization with non-convex uncertainty sets Salle 31 Learning and dynamic programming, Chair: Boxiao Chen, session 381 Markov Build B, Z 5 Ground Floor 2x30 min Manu Gupta, A unifying computation of Whittle’s Index for Markovian bandits Jose Nino-Mora, A verification theorem for indexability of real-state restless ban- dits Room Continuous Optimization - Monday 5:00 PM – 6:30 PM GINTRAC Gradient Methods for Constrained Optimization Problems, Organizer: Igor Konnov, session 4 NLP Build Q, Z 8 Ground Floor 3x30 min Igor Konnov, Simple Adaptive Versions of Iterative Optimization Methods Alexander Zaslavski, Subgradient Projec- tion Algorithm with Computational Errors Andrea Cristofari, An active-set frame- work for minimizing nonconvex functions over the simplex Salle 05 Polynomial and tensor optimization III, Organizer: Jiawang Nie, session 7 NLP Build Q, Z 11 1st floor 4x20 min Lek-Heng Lim, Higher order cone pro- gramming Ke Ye, Ranks and decompositions of Han- kel tensors Annie Raymond, Symmetric Sums of Squares over k-Subset Hypercubes Jiawang Nie, Tight relaxations for polyno- mial optimization and lagrange multiplier expression Salle 9 Modeling in NLP, Chair: Laura Balzano, session 433 NLP Build N, Z 12 4th floor 3x20 min Laura Balzano, Low Algebraic Dimen- sion Matrix Completion Mirai Tanaka, DC programming algo- rithm for fully convex bilevel optimization Nuttapol Pakkaranang, An inertial prox- imal point methods for solving minimiza- tion problems Salle 8 Extending the Reach of First-Order Methods, Part I, Organizer: Haihao Lu, session 285 NonSmooth Build N, Z 12 4th floor 3x30 min Benjamin Grimmer, Subgradient Method Convergence Rates without Lipschitz Con- tinuity or Convexity Yurii Nesterov, Relative smoothness con- dition and its application to third-order methods. Haihao Lu, Generalized Stochastic Frank- Wolfe Method Salle 20 Solving large scale convex composite programming, Organizer: Kim-Chuan Toh, session 130 SDP Build G, Z 6 1st floor 3x30 min Kim-Chuan Toh, A block symmetric Gauss-Seidel decomposition theorem for convex composite QP Xin Yee Lam, Fast algorithms for large scale generalized distance weighted dis- crimination Yancheng Yuan, An Efficient Semismooth Newton Based Algorithm for Convex Clustering Salle LC5 Convergence and Approximation in Conic Programming, Chair: Tamás Terlaky, session 465 SDP Build L, Z 10 Intermediate 1 3x30 min Nuri Vanli, Convergence Rate of Block Coordinate Ascent for Nonconvex Burer- Monteiro Method Yuriy Zinchenko, Towards efficient ap- proximation of p-cones Tam´as Terlaky, Quadratic convergence to the optimal solution of second-order conic optimization Salle 06 Nonlinear Optimization and Variational Inequalities VI, Organizer: Cong Sun, session 146 Variat Build Q, Z 11 1st floor 4x20 min Fengmin Xu, Balance analysis of sparsity and robustness for portfolio adjustment problem Chao Zhang, Two-stage stochastic pro- gram and stochastic variational inequalities Xiao Wang, Proximal Stochastic Quasi- Newton methods for Nonconvex Compos- ite Optimization Zhongming Wu, General inertial proximal gradient method for nonconvex nonsmooth optimization Salle ARNOZAN Variational Analysis 4, Organizer: Jo A. Brueggemann, session 370 Variat Build Q, Z 8 Ground Floor 4x20 min Jo Brueggemann, Path-following method for a class of obstacle problems with inte- gral constraints Yboon Garc´ia Ramos, Nonconvex integra- tion using -subdi fferentials Yakui Huang, A family of two-point step- size gradient methods Khoa Nguyen, Proximal alternating direc- tion method of multipliers in the noncon- vex setting Salle KC6 Complexity of Randomized Algorithms, Organizer: Raghu Pasupathy, session 347 RandomM Build K, Z 10 Intermediate 1 3x20 min Martin Morin, On the Convergence of SAGA-like Algorithms Bang Vu, On the linear convergence of the projected stochastic gradient method Raghu Pasupathy, The Complexity of Adaptive Sampling Accelerated Gradient Dsescent Salle 21 Advances in DFO I, Chair: Sébastien Le Digabel, session 40 DerFree Build G, Z 6 Intermediate 3x30 min Warren Hare, Calculus Rules of the Sim- plex Gradient Miguel Munoz Zuniga, Derivative free global Optimization with categorical- continuous variables Stefan Wild, A Taxonomy of Constraints for Blackbox-Based Optimization Salle AURIAC Advances in optimization methods for time dependent problems:I, Organizer: Matthias Heinkenschloss, session 223 Control Build G, Z 6 1st floor 4x20 min Mihai Anitescu, Exponentially convergent receding horizon constrained optimal con- trol Carl Laird, Parallel strategies for DAE optimization with direct Schur- complement decomp. Johannes Haubner, Shape optimization for unsteady fluid-structure interaction Matthias Heinkenschloss, A parallel-in- time gradient-type method for optimal con- trol problems 72 Yüklə 23,3 Mb. Dostları ilə paylaş:
|