Journal: Math. Program.

Volume 184, Issue 1

1 -- 34Dusan Knop, Martin Koutecký, Matthias Mnich. Combinatorial n-fold integer programming and applications
35 -- 70Peng Xu, Fred Roosta, Michael W. Mahoney. Newton-type methods for non-convex optimization under inexact Hessian information
71 -- 120Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford. Lower bounds for finding stationary points I
121 -- 154Loris Cannelli, Francisco Facchinei, Vyacheslav Kungurtsev, Gesualdo Scutari. Asynchronous parallel algorithms for nonconvex optimization
155 -- 182Xiangkun Shen, Viswanath Nagarajan. q-norm objectives and applications to network design
183 -- 220Yoel Drori, Adrien B. Taylor. Efficient first-order methods for convex minimization: a constructive approach
221 -- 241Amir Ali Ahmadi, Jeffrey Zhang. On the complexity of testing attainment of the optimal value in nonlinear optimization
243 -- 287Hédy Attouch, Alexandre Cabot. Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
289 -- 318Johannes O. Royset. Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
319 -- 348Franck Iutzeler, Jérôme Malick, Welington de Oliveira. Asynchronous level bundle methods
349 -- 381Heinz H. Bauschke, Minh N. Bui, Xianfu Wang. Applying FISTA to optimization problems (with or) without minimizers
383 -- 410Yura Malitsky. Golden ratio algorithms for variational inequalities
411 -- 443Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan. A tight $\sqrt{2}$-approximation for linear 3-cut
445 -- 490Junyu Zhang, Shiqian Ma, Shuzhong Zhang. Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
491 -- 530Dimitris Bertsimas, Jourdain B. Lamperski, Jean Pauphilet. Certifiably optimal sparse inverse covariance estimation