2687 | -- | 2725 | Antonio Silveti-Falls, Cesare Molinari, Jalal Fadili. Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization |
2726 | -- | 2749 | El Houcine Bergou, Eduard A. Gorbunov, Peter Richtárik. Stochastic Three Points Method for Unconstrained Smooth Minimization |
2750 | -- | 2779 | Geovani Nunes Grapiglia, Yurii E. Nesterov. Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives |
2780 | -- | 2808 | Haihao Lu, Rahul Mazumder. Randomized Gradient Boosting Machine |
2809 | -- | 2840 | Jun Li 0012, Giandomenico Mastroeni. n and Applications to Integer Linear Programming |
2841 | -- | 2865 | Daniel Duque, David P. Morton. Distributionally Robust Stochastic Dual Dynamic Programming |
2866 | -- | 2896 | Quoc Tran-Dinh, Yuzixuan Zhu. Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates |
2897 | -- | 2926 | Bo Jiang 0007, Tianyi Lin, Shuzhong Zhang. A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization |
2927 | -- | 2955 | Wooseok Ha, Haoyang Liu, Rina Foygel Barber. An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations |
2956 | -- | 2982 | Eike Börgens, Christian Kanzow, Patrick Mehlitz, Gerd Wachsmuth. New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions |
2983 | -- | 2997 | Asteroide Santana, Santanu S. Dey. The Convex Hull of a Quadratic Constraint over a Polytope |
2998 | -- | 3028 | Konstantin Usevich, Jianze Li, Pierre Comon. Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms |
3029 | -- | 3068 | Amir Daneshmand, Gesualdo Scutari, Vyacheslav Kungurtsev. Second-Order Guarantees of Distributed Gradient Algorithms |
3069 | -- | 3097 | Silvia Bonettini, Marco Prato, Simone Rebegoldi. Convergence of Inexact Forward-Backward Algorithms Using the Forward-Backward Envelope |
3098 | -- | 3121 | Yuxin Chen 0002, Yuejie Chi, Jianqing Fan, Cong Ma, Yuling Yan. Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization |
3122 | -- | 3145 | Marianna De Santis, Gabriele Eichfelder, Julia Niebling, Stefan Rocktäschel. Solving Multiobjective Mixed Integer Convex Optimization Problems |
3146 | -- | 3169 | Nikita Doikov, Yurii E. Nesterov. Contracting Proximal Methods for Smooth Convex Optimization |
3170 | -- | 3197 | Junzi Zhang, Brendan O'Donoghue, Stephen P. Boyd. Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations |
3198 | -- | 3229 | Wei Wang, Huifu Xu. Robust Spectral Risk Optimization When Information on Risk Spectrum Is Incomplete |
3230 | -- | 3251 | Aryan Mokhtari, Asuman E. Ozdaglar, Sarath Pattathil. Convergence Rate of 풪(1/k) for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems |
3252 | -- | 3283 | Hédy Attouch, Szilárd Csaba László. Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators |
3284 | -- | 3314 | Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia. Fair Packing and Covering on a Relative Scale |
3315 | -- | 3344 | Hamed Hassani, Amin Karbasi, Aryan Mokhtari, Zebang Shen. Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization |
3345 | -- | 3358 | Felix Lieder. Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem |
3359 | -- | 3386 | Weijun Xie 0001, Xinwei Deng. Scalable Algorithms for the Sparse Ridge Regression |
3387 | -- | 3414 | Bruno F. Lourenço, Akiko Takeda. Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras |