Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Continuous Optimization - Thursday 8:30 AM – 10:30 AM Salle ARNOZAN First-order methods: advances and applications, Organizer: Immanuel M. Bomze, session 3 NLP Build Q, Z 8 Ground Floor 4x30 min Axel Boehm, Incremental mirror descent with random sweeping and a proximal step Immanuel Bomze, Active-set identification in Frank-Wolfe variants on the standard simplex Michael Kahr, Robust StQP, first-order methods, and applications in social net- work analysis Mathias Staudigl, On the convergence of projection free Hessian Barrier-Gradient Algorithms GINTRAC Recent advances in interior point methods and NLP, Organizer: Michael Todd, session 77 NLP Build Q, Z 8 Ground Floor 4x30 min Michael Todd, The ellipsoid method redux E. Alper Yildirim, MILP Formulations for Globally Solving Nonconvex Standard Quadratic Programs Yinyu Ye, A One-phase Interior Point Method For Nonconvex Optimization Oliver Hinder, A polynomial time interior point method for problems with nonconvex constraints Salle 05 Machine learning for optimisation, Organizer: Coralia Cartis, session 176 NLP Build Q, Z 11 1st floor 4x30 min Adilet Otemissov, Dimensionality reduc- tion for global optimisation: adaptive ran- dom embeddings Coralia Cartis, Stochastic trust-region with global rate to second-order criticality Radu Baltean-Lugojan, Online generation via o ffline selection of strong linear cuts from QP SDP relax. Boris Houska, Global optimization in Hilbert Space Salle KC7 First Order Methods I, Chair: Sandra A. Santos, session 436 NLP Build K, Z 10 Intermediate 2 4x30 min Sandra Santos, Accelerating block coor- dinate descent methods with identification strategies Francesco Locatello, On Matching Pur- suit and Coordinate Descent Tianyi Lin, A Unified Scheme to Accel- erate Adaptive Cubic Regularization and Gradient Method Felix Lieder, Performance Estimation for Fixed Point Iterations Salle LC4 Universal methods in non-smooth analysis, Organizer: Alexander Gasnikov, session 53 NonSmooth Build L, Z 9 Intermediate 1 4x30 min Alexander Tyurin, Universal Nesterov’s gradient method in general model concep- tion Sergey Guminov, Dual universal conjugate gradient type methods. Alexander Tytov, Universal Proximal Method for Variational Inequalities Dmitry Kamzolov, Universal Intermedi- ate Gradient Method for Convex Problems with Inexact Oracle Salle 8 First-order methods for nonconvex and pathological convex problems, Organizer: Wotao Yin, session 183 NonSmooth Build N, Z 12 4th floor 4x30 min Mila Nikolova, Alternating structure- adapted proximal gradient descent for non- convex problems Wenbo Gao, ADMM for Multiaffine Con- strained Optimization Ernest Ryu, Douglas-Rachford Splitting for Pathological Convex Optimization Wotao Yin, Polynomial-Time Run-and- Inspect Method for Certain Nonconvex Optimization Salle 9 Non smooth optimization for lage scale poblems, Organizer: Yu Du, session 556 NonSmooth Build N, Z 12 4th floor 4x30 min Yu Du, Selective Linearization for Multi- block Statistical Learning Problems Dmitry Grishchenko, Randomized Proxi- mal Algorithm with Automatic Dimension Reduction. Shummin Nakayama, Inexact proximal memoryless spectral-scaling MBFGS method Min Tao, Decomposition methods for com- puting d-stationary solutions for noncon- vex problem Salle 20 Computer-assisted analyses of optimization algorithms I, Organizer: Adrien Taylor, session 19 SDP Build G, Z 6 1st floor 4x30 min Yoel Drori, Efficient First-order Methods for Convex Minimization: A Constructive Approach Donghwan Kim, Optimized first-order method for decreasing gradient of smooth convex functions Bryan Van Scoy, The Fastest Known First- Order Method for Smooth Strongly Con- vex Minimization Laurent Lessard, Analysis of First-Order Algorithms for Distributed Optimization Salle LC5 Geometry and duality in convex optimization, Organizer: Javier F Pena, session 160 SDP Build L, Z 10 Intermediate 1 4x30 min David Gutman, Condition Numbers for Convex Functions with Polytope Domains Javier Pena, Conditioning of conic systems via the Grassmannian manifold Jourdain Lamperski, Solving linear in- equalities via non-convex optimization Gabor Pataki, On positive duality gaps in semidefinite programming Salle 06 Nonlinear Optimization and Variational Inequalities I, Organizer: Xin Liu, session 140 Variat Build Q, Z 11 1st floor 4x30 min Yaxiang Yuan, Theory and Applicaiton of p-regularized subproblem with p > 2 Jinyan Fan, A semidefinite relaxation algo- rithm for polynomial equations Cong Sun, On a special robust optimiza- tion problem Liang Zhao, Limited memory algorithms with cubic regularization Salle KC6 Recent Advances on Stochastic Algorithms and Machine Learning, Organizer: Shiqian Ma, session 202 RandomM Build K, Z 10 Intermediate 1 4x30 min Qihang Lin, Level-Set Methods for Finite- Sum Constrained Convex Optimization Xudong Li, Estimation of Markov Chain via Rank-constrained Likelihood Guanghui Lan, Random gradient extrapo- lation for distributed and stochastic opti- mization Renbo Zhao, An Accelerated Algorithm for Stochastic Three-composite Optimiza- tion Salle 21 Bayesian and Randomized Optimization I, Chair: Stefan M Wild, session 39 DerFree Build G, Z 6 Intermediate 4x30 min Mickael Binois, Improving Bayesian opti- mization via random embeddings Saul Toscano-Palmerin, Bayesian Opti- mization of Expensive Integrands Cl´ement Royer, Using Models in Allocate and Partition Algorithms Youssef Diouane, A Rigorous Framework for E fficient Global Optimization Salle AURIAC Optimal Control of Variational Inequalities and Complementarity Systems, Chair: Alexandre Vieira, session 336 Control Build G, Z 6 1st floor 4x30 min Alexandre Vieira, Optimal control of Lin- ear Complementarity Systems Anne-Therese Rauls, Computing a Sub- gradient for the Solution Operator of the Obstacle Problem Ailyn St¨otzner, Optimal Control of Ther- moviscoplasticity Anna Walter, Optimal Control of Elasto- plasticity Problems with Finite Deforma- tions 87 Yüklə 23,3 Mb. Dostları ilə paylaş:
|