Program for stream Nonsmooth and nonconvex optimization

MB-02: Optimization and applications
Stream: Nonsmooth and nonconvex optimization
Room: B100/7011
Chair(s): Morteza Rahimi, Arghya Sinha

• A Strongly Convex Framework for Image Reconstruction Using Generic Smoothing Filters
  Arghya Sinha, Kunal N. Chaudhury
• Random embeddings for global optimization: convergence results beyond isotropy
  Roy Makhlouf, Estelle Massart
• Optimization Techniques for Sparse and Structured Solutions in Big Data
  Maurine Wafula, Leah Mutanu
• Mapping Financial Well-Being: A Bayesian Spatial Clustering Analysis of Regional Economic Disparities
  Lok-Yung Wong

MB-06: Nonsmooth optimization: from continuous to discrete Part I
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Alberto De Marchi

• Mixed-integer linearity in nonlinear optimization
  Alberto De Marchi
• Lyapunov functions and control for differential inclusions by optimization
  SIGURDUR HAFSTEIN
• Finding and exploiting quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
  Markus Gabl, Immanuel Bomze

MC-02: Matrix factorization
Stream: Nonsmooth and nonconvex optimization
Room: B100/7011
Chair(s): Atharva Awari

• Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions
  Atharva Awari, Nicolas Gillis, Arnaud Vandaele
• Instance-wise Distributionally Robust Nonnegative Matrix Factorization
  Amjad Seyedi, Nicolas Gillis
• Implicit Bias in Matrix Factorization and its Explicit Realization in a new Architecture
  Yikun Hou, Suvrit Sra, Alp Yurtsever

MC-06: Nonsmooth optimization: from continuous to discrete Part II
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Alberto De Marchi

• Paley graphs, stable sets and the exact subgraph hierarchy: Bad and good news
  Elisabeth Gaar, Dunja Pucher
• A modified proximal point algorithm involving generalized nonexpansive mappings
  Izhar Uddin
• Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
  Pierluigi Mansueto, Matteo Lapucci, Giampaolo Liuzzi, Stefano Lucidi

MD-02: Optimization in machine Learning
Stream: Nonsmooth and nonconvex optimization
Room: B100/7011
Chair(s): Alireza Kabgani, Lorenzo Ciarpaglini

• Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
  Karlo Palenzuela, Ali Dadras, Alp Yurtsever
• Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis
  Ruichen Luo, Sebastian Stich, Samuel Horvath, Martin Takac
• Convex Formulations For Training Two-Layer ReLU Neural Networks
  Karthik Prakhya, TOLGA BIRDAL, Alp Yurtsever
• Exploring Step Size Adaptation in Large-Scale Deep Learning Optimization
  Lorenzo Ciarpaglini, Laura Palagi, Diego Scuppa, Marco Sciandrone

MD-06: Smoothing techniques for nonsmooth optimization
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Olivier Fercoq

• Second-order proximal-gradient methods for avoiding nonsmooth strict saddle points
  Alexander Bodard, Masoud Ahookhosh, Panagiotis Patrinos
• A Proximal Variable Smoothing for Nonsmooth Minimization of the Sum of Three Functions Including Weakly Convex Composite Function
  Keita Kume, Isao Yamada
• Analyzing the speed of convergence in nonsmooth optimization via the Goldstein epsilon-subdifferential
  Bennet Gebken
• Minimizing the smoothed gap to solve saddle point problems
  Olivier Fercoq

TB-02: Infinite-dimensional optimization - Part I
Stream: Nonsmooth and nonconvex optimization
Room: B100/7011
Chair(s): Behzad Azmi

• Asymptotic behavior of penalty dynamics for constrained variational inequalities
  Siqi Qu, Mathias Staudigl, Juan Peypouquet
• Inertial dynamics with vanishing Tikhonov regularization for multiobjective optimization
  Konstantin Sonntag

TB-06: Advances in nonsmooth optimization
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Alireza Kabgani, Vladimir Shikhman

• Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
  Yassine Nabou, Lahcen EL BOURKHISSI, Sebastian Stich, Tuomo Valkonen
• Global convergence of a second-order augmented Lagrangian method under an error bound condition
  Renan William Prado, Gabriel Haeser, Roberto Andreani, Maria Laura Schuverdt, Leonardo Delarmelina Secchin
• NON-EUCLIDEAN PROXIMAL METHODS FOR CONVEX-CONCAVE SADDLE-POINT PROBLEMS
  Eyal Cohen, Shoham Sabach, Marc Teboulle
• Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
  Vladimir Shikhman

TC-02: Infinite-dimensional optimization - Part II
Stream: Nonsmooth and nonconvex optimization
Room: B100/7011
Chair(s): Behzad Azmi

• A Fast Iterative Method for Variational Inequality and Classification Problems
  Lateef Jolaoso
• An Interior-Proximal Point Method for Nonsmooth, Nonconvex PDE-Constrained Problems with State Constraints
  Behzad Azmi, Alberto De Marchi

TC-06: Structured nonsmooth optimization -- Part I
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Karl Welzel

• Equivalence between Linear Convergence and Error Bounds for Optimization Algorithms
  Kira van Treek, Javier Peña, Juan Vera, Luis Zuluaga
• Blockwise DC Programming
  Hoomaan Maskan, Pouria Fatemi, Alp Yurtsever, Suvrit Sra
• Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty
  Guillaume Van Dessel, François Glineur
• Local convergence of adaptively regularized tensor methods
  Karl Welzel, Coralia Cartis, Raphael Hauser, Yang Liu

WB-02: High-order and tensor methods
Stream: Nonsmooth and nonconvex optimization
Room: B100/7011
Chair(s): Wenqi Zhu

• Efficient Adaptive Regularized Tensor Methods
  Yang Liu, Karl Welzel, Coralia Cartis, Raphael Hauser, Wenqi Zhu
• A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
  Tianyun Tang
• On Global Rates for Regularization Methods Based on Secant Derivative Approximations
  Sadok Jerad, Coralia Cartis
• Beyond Second Order Methods for Nonconvex Optimization
  Wenqi Zhu

WB-06: Structured nonsmooth optimization -- Part II
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Behzad Azmi

• Douglas-Rachford splitting algorithm for projected solution of quasi variational inequality with non-self constraint map
  Maede Ramazannejad
• On the relation between approximate and exact stationarity in disjunctive optimization
  Isabella Käming, Patrick Mehlitz
• Constrained Optimization in the Presence of Noise
  Figen Oztoprak
• A sharp augmented Lagrangian-based method for solving constrained DC optimization
  Sona Taheri

WC-06: Structured nonsmooth optimization -- Part III
Stream: Nonsmooth and nonconvex optimization
Room: B100/7013
Chair(s): Bastien Massion, Alireza Kabgani

• Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under (L0,L1)-Smoothness
  Aleksandr Lobanov
• Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
  Iyad WALWIL, Olivier Fercoq
• A full splitting algorithm for structured difference-of-convex programs
  Rossen Nenov
• An accelerated projected gradient descent for Grassmannian frame computation
  Bastien Massion, Estelle Massart