Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Continuous Optimization - Wednesday 8:30 AM – 10:30 AM GINTRAC Stochastic and Nonlinear Optimization III, Organizer: Jorge Nocedal, session 31 NLP Build Q, Z 8 Ground Floor 4x30 min Fred Roosta, Efficient Newton-type meth- ods for non-convex machine learning prob- lems Jorge Nocedal, Optimization Methods for Training Neural Networks Stephen Wright, A Newton-CG Method with Complexity Guarantees Uday Shanbhag, Smoothed Variable Sample-size Acc. Prox. Methods for Stoch. Convex Optimization Salle 05 Optimality conditions in NLP and conic problems, Organizer: Roberto Andreani, session 43 NLP Build Q, Z 11 1st floor 4x30 min Roberto Andreani, A SEQUENTIAL OP- TIMALITY CONDITION RELATED TO THE QUASINORMALITY CQ Gabriel Haeser, An extension of Yuan’s Lemma and its applications in optimization Luis Felipe Bueno, Optimality Conditions for Generalized Nash Equilibrium Prob- lems Tatiana Tchemisova, On Optimality Condi- tions for Linear Copositive Programming Salle KC7 Computational advances in NLP, Chair: Je ffrey CH Pang, session 434 NLP Build K, Z 10 Intermediate 2 4x30 min Alfonso Lobos Ruiz, Optimal Bidding, Allocation, and Budget Spending for a Demand-Side Platform. Jeffrey Pang, Distributed deterministic asynchronous optimization using Dyk- stra’s splitting Zhening Li, Decompositions and optimiza- tions of symmetric conjugate complex forms Max Goncalves, An inexact Newton- like conditional gradient method for con- strained systems Salle 9 Fixed Point Approaches, Chair: Poom Kumam, session 435 NLP Build N, Z 12 4th floor 4x30 min Konrawut Khammahawong, Convergence analysis of S-iteration process for discon- tinuous operators Poom Kumam, A new lgorithms for split feasibility problems involving paramono- tone equilibria Khanitin Muangchoo-in, Fixed point and convergence theorems for monotone (α, β)-nonexpansive Wudthichai Onsod, Monotone generalized almost contraction on weighted graph Salle LC4 Recent advances in first-order algorithms for non-smooth optimization, Organizer: Thomas Pock, session 198 NonSmooth Build L, Z 9 Intermediate 1 4x30 min Peter Ochs, Non-smooth Non-convex Bregman Minimization: Unification and new Algorithms Yura Malitsky, Primal-dual algorithm for linearly constrained optimization problem Matthias Ehrhardt, Stochastic PDHG with Arbitrary Sampling and Applications to Medical Imaging Stanislav Mazurenko, Acceleration and global convergence of the NL-PDHGM Salle 8 Dynamical Systems and Optimization, Organizer: Hedy Attouch, session 351 NonSmooth Build N, Z 12 4th floor 4x30 min Radu Ioan Bot, The continuous proximal- gradient approach in the nonconvex setting Alexandre Cabot, Accelerated Forward- Backward Algorithms Juan Peypouquet, Inertial proximal algo- rithms for maximally monotone operators Silvia Villa, A dual diagonal iterative reg- ularization method Salle AURIAC Recent Advances in Conic Programming II, Organizer: Sena Safarina, session 83 SDP Build G, Z 6 1st floor 4x30 min Rujun Jiang, Convex Relaxations for Nonconvex Quadratically Constrained Quadratic Program Sena Safarina, Cone Decomposition Method for Mixed-Integer SOCP arising from tree breeding Goran Banjac, Infeasibility detection in ADMM for convex optimization Marta Cavaleiro, A Simplex-like algo- rithm for the infimum point w.r.t. the sec- ond order cone Salle 20 Theory and algorithms in conic linear programming 2, Organizer: Gabor Pataki, session 89 SDP Build G, Z 6 1st floor 4x30 min Masakazu Muramatsu, An extension of Chubanov’s algorithm to symmetric cone programming Joachim Dahl, Extending MOSEK with ex- ponential cones Stefan Sremac, Primal Facial Reduction in Semidefinite Programming and Matrix Completions Bruno Lourenco, Amenable cones: bridg- ing error bounds and facial reduction Salle LC5 New trends II, Chair: Frank Permenter, session 500 SDP Build L, Z 10 Intermediate 1 4x30 min Claudia Adams, An L 2 -approach to Copos- itivity Faizan Ahmed, On algorithms to optimize homogeneous polynomial over the simplex and the sphere John Mitchell, Complementarity formula- tions of rank minimization problems Frank Permenter, Interior-point methods via the exponential map Salle 06 Stochastic Optimization and Variational Inequalities II, Organizer: Alejandro R. Jofre, session 156 Variat Build Q, Z 11 1st floor 2x30 min Yueyue Fan, How does uncertainty of de- mand propagate to flows under network equilibrium Alejandro Jofre, Variance-based stochas- tic extragradient methods with linear search for Stoch. VI Salle ARNOZAN Variational Analysis 1, Organizer: Samir Adly, session 364 Variat Build Q, Z 8 Ground Floor 4x30 min Alexandra Schwartz, Second Order Op- timality Conditions for Cardinality Con- strained Problems Helmut Gfrerer, Stability Analysis for Parameterized Equilibria with Conic Con- straints Michel Thera, Stability and Sensitiv- ity Analysis of Parametrized Optimization Problems Samir Adly, Sensitivity analysis of param- eterized nonlinear variational inequalities. Salle KC6 First Order Methods for Non-Smooth Constrained Optimization, Organizer: Qihang Lin, session 305 RandomM Build K, Z 10 Intermediate 1 4x30 min Shiqian Ma, On the Non-Ergodic Conver- gence Rate of an Inexact Augmented La- grangian Framework Selvaprabu Nadarajah, A level-set method for stochastic optimization with expecta- tion constraints Peng Zheng, Fast method for non-smooth non-convex minimization DaoLi Zhu, Stochastic Primal-Dual Coor- dinate Method for Nonlinear Convex Cone Programs Salle 21 New derivative-free algorithms, Chair: Margherita Porcelli, session 34 DerFree Build G, Z 6 Intermediate 4x30 min Margherita Porcelli, Gray-box optimiza- tion of structured problems and other new developments in BFO Francesco Rinaldi, Model-based derivative-free methods for nonsmooth black-box functions Lindon Roberts, A flexible, robust and e fficient derivative-free solver for least squares Ana Custodio, MultiGLODS: Clever Mul- tistart in Multiobjective Directional Direct Search 79 Yüklə 23,3 Mb. Dostları ilə paylaş:
|