| 1 | -- | 30 | Chao Zhang, Xiaojun Chen 0001. A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization |
| 31 | -- | 55 | Yun-Bin Zhao. Optimal k-Thresholding Algorithms for Sparse Optimization Problems |
| 56 | -- | 79 | Amir Beck, Nadav Hallak. On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods |
| 80 | -- | 101 | Luis Felipe Bueno, José Mario Martínez. On the Complexity of an Inexact Restoration Method for Constrained Optimization |
| 102 | -- | 131 | Sebastian Banert, Axel Ringh, Jonas Adler, Johan Karlsson, Ozan Öktem. Data-Driven Nonsmooth Optimization |
| 132 | -- | 148 | Xiao-Xiao Ma, Meng-Meng Zheng, Zheng-Hai Huang. A Note on the Nonemptiness and Compactness of Solution Sets of Weakly Homogeneous Variational Inequalities |
| 149 | -- | 181 | Andreas Themelis, Panagiotis Patrinos. Douglas-Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results |
| 182 | -- | 209 | Yuchen Xie, Richard H. Byrd, Jorge Nocedal. Analysis of the BFGS Method with Errors |
| 210 | -- | 239 | Shixiang Chen, Shiqian Ma, Anthony Man-Cho So, Tong Zhang. Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold |
| 240 | -- | 261 | Igor Klep, Jiawang Nie. A Matrix Positivstellensatz with Lifting Polynomials |
| 262 | -- | 289 | Vincent Roulet, Alexandre d'Aspremont. Sharpness, Restart, and Acceleration |
| 290 | -- | 318 | Constantin Christof. Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level |
| 319 | -- | 348 | A. Jourani, Francisco J. Silva. Existence of Lagrange Multipliers under Gâteaux Differentiable Data with Applications to Stochastic Optimal Control Problems |
| 349 | -- | 376 | Courtney Paquette, Katya Scheinberg. A Stochastic Line Search Method with Expected Complexity Analysis |
| 377 | -- | 406 | Johanna Burtscheidt, Matthias Claus, Stephan Dempe. Risk-Averse Models in Bilevel Stochastic Linear Programming |
| 407 | -- | 438 | Vincent Guigues. Inexact Cuts in Stochastic Dual Dynamic Programming |
| 439 | -- | 463 | Armin Eftekhari, Raphael A. Hauser. Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima |
| 464 | -- | 489 | Michel De Lara, Olivier Gossner. Payoffs-Beliefs Duality and the Value of Information |
| 490 | -- | 512 | Xi Yin Zheng. Well-Posed Solvability of Convex Optimization Problems on a Differentiable or Continuous Closed Convex Set |
| 513 | -- | 541 | Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint. Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints |
| 542 | -- | 584 | D. Russell Luke, Anna-Lena Martins. Convergence Analysis of the Relaxed Douglas-Rachford Algorithm |
| 585 | -- | 603 | Eduardo Casas, Mariano Mateos. Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization |
| 604 | -- | 629 | Aram V. Arutyunov, Alexey F. Izmailov. Covering on a Convex Set in the Absence of Robinson's Regularity |
| 630 | -- | 659 | Chao Ding, Defeng Sun, Jie Sun 0001, Kim-Chuan Toh. Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian |
| 660 | -- | 686 | Xiao Li, Zhihui Zhu, Anthony Man-Cho So, René Vidal. Nonconvex Robust Low-Rank Matrix Recovery |
| 687 | -- | 716 | Zhengyuan Zhou, Panayotis Mertikopoulos, Nicholas Bambos, Stephen P. Boyd, Peter W. Glynn. On the Convergence of Mirror Descent beyond Stochastic Convex Programming |
| 717 | -- | 751 | Necdet Serhat Aybat, Alireza Fallah 0001, Mert Gürbüzbalaban, Asuman E. Ozdaglar. Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions |
| 752 | -- | 780 | Johannes O. Royset. Stability and Error Analysis for Optimization and Generalized Equations |
| 781 | -- | 797 | Xiaoyi Gu, Shabbir Ahmed 0001, Santanu S. Dey. Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming |
| 798 | -- | 822 | Monaldo Mastrolilli. High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy, and Chvátal-Gomory Cuts |
| 823 | -- | 852 | Junyi Liu, Suvrajeet Sen. Asymptotic Results of Stochastic Decomposition for Two-Stage Stochastic Quadratic Programming |
| 853 | -- | 884 | Warren Hare, Gabriel Jarry-Bolduc. Calculus Identities for Generalized Simplex Gradients: Rules and Applications |
| 885 | -- | 914 | Seyed Rasoul Etesami. Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks |
| 915 | -- | 932 | Rujun Jiang, Duan Li 0002. A Linear-Time Algorithm for Generalized Trust Region Subproblems |
| 933 | -- | 959 | Konstantin Mishchenko, Franck Iutzeler, Jérôme Malick. A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm |
| 960 | -- | 979 | Saeed Ghadimi, Andrzej Ruszczynski, Mengdi Wang. A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization |
| 980 | -- | 1006 | Francisco J. Aragón Artacho, Phan T. Vuong. The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions |
| 1007 | -- | 1032 | Daniel Porumbel. Projective Cutting-Planes |
| 1033 | -- | 1047 | James Saunderson. Limitations on the Expressive Power of Convex Cones without Long Chains of Faces |
| 1048 | -- | 0 | Dorit S. Hochbaum, Cheng Lu. Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems |