1.
Fast alternating linearization methods for minimizing the sum of two convex functions
by Goldfarb, Donald
Mathematical programming, 2012-03-24, Vol.141 (1-2), p.349-382

2.
Sub-sampled Newton methods
by Roosta-Khorasani, Farbod
Mathematical programming, 2018-11-16, Vol.174 (1-2), p.293-326

3.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
by Attouch, Hedy
Mathematical programming, 2011-08-20, Vol.137 (1-2), p.91-129

4.
From error bounds to the complexity of first-order descent methods for convex functions
by Bolte, Jérôme
Mathematical programming, 2016-11-30, Vol.165 (2), p.471-507

5.
Minimizing finite sums with the stochastic average gradient
by Schmidt, Mark
Mathematical programming, 2016-06-14, Vol.162 (1-2), p.83-112

6.
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing
by Bankevich, Anton
Journal of computational biology, 2012-05-01, Vol.19 (5), p.455-477

7.
UV and humidity sensing properties of ZnO nanorods prepared by the arc discharge method
by Fang, F
Nanotechnology, 2009-06-17, Vol.20 (24), p.245502-245502 (7)

8.
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
by Cartis, C
Mathematical programming, 2017-04-01, Vol.169 (2), p.337-375

9.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
by Richtarik, Peter
Mathematical programming, 2012-12-04, Vol.144 (1-2), p.1-38

10.
Infomap Bioregions: Interactive Mapping of Biogeographical Regions from Species Distributions
by Edler, Daniel
Systematic biology, 2017-03-01, Vol.66 (2), p.197-204

11.
Gradient methods for minimizing composite functions
by Nesterov, Yu
Mathematical programming, 2012-12-21, Vol.140 (1), p.125-161

12.
An inexact dual logarithmic barrier method for solving sparse semidefinite programs
by Bellavia, Stefania
Mathematical programming, 2018-04-28, Vol.178 (1-2), p.109-143

13.
First-order methods of smooth convex optimization with inexact oracle
by Devolder, Olivier
Mathematical programming, 2013-06-14, Vol.146 (1-2), p.37-75

14.
A critical assessment of the truly Meshless Local Petrov-Galerkin (MLPG), and Local boundary Integral Equation (LBIE) methods
by ATLURI, S. N
Computational mechanics, 1999, Vol.24 (5), p.348-372

15.
Sidescan sonar meets airborne and satellite remote sensing: challenges of a multi-device seafloor classification in extreme shallow water intertidal environments
by Capperucci, R. M
Geo-marine letters, 2020-02-12, Vol.40 (2), p.117-133

16.
Universal gradient methods for convex optimization problems
by Nesterov, Yu
Mathematical programming, 2014-05-28, Vol.152 (1-2), p.381-404

17.
cutPrimers: A New Tool for Accurate Cutting of Primers from Reads of Targeted Next Generation Sequencing
by Kechin, Andrey
Journal of computational biology, 2017-11-01, Vol.24 (11), p.1138-1143

18.
UV light emitting transparent conducting tin-doped indium oxide (ITO) nanowires
by Gao, J
Nanotechnology, 2011-05-13, Vol.22 (19), p.195706-195706

19.
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
by Cartis, Coralia
Mathematical programming, 2010-01-10, Vol.130 (2), p.295-319

20.
Efficient first-order methods for convex minimization: a constructive approach
by Drori, Yoel
Mathematical programming, 2019-06-24, Vol.184 (1-2), p.183-220
