| Publication | Date of Publication | Type |
|---|
Variable metric proximal stochastic gradient methods with additional sampling Computational Optimization and Applications | 2026-01-19 | Paper |
Spectral stochastic gradient method with additional sampling for finite and infinite sums Computational Optimization and Applications | 2025-06-20 | Paper |
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems Optimization Methods & Software | 2024-11-28 | Paper |
A non-monotone trust-region method with noisy oracles and additional sampling Computational Optimization and Applications | 2024-09-17 | Paper |
Spectral projected subgradient method for nonsmooth convex optimization problems Numerical Algorithms | 2023-04-20 | Paper |
EFIX: exact fixed point methods for distributed optimization Journal of Global Optimization | 2023-03-14 | Paper |
LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums Mathematics of Computation | 2023-02-24 | Paper |
An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems Journal of Computational and Applied Mathematics | 2023-01-11 | Paper |
| AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems | 2022-08-22 | Paper |
Spectral Projected Subgradient Method for Nonsmooth Convex Optimization Problems (available as arXiv preprint) | 2022-03-23 | Paper |
Distributed fixed point method for solving systems of linear algebraic equations Automatica | 2021-11-19 | Paper |
Subsampled inexact Newton methods for minimizing large sums of convex functions IMA Journal of Numerical Analysis | 2021-03-31 | Paper |
An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (available as arXiv preprint) | 2021-03-25 | Paper |
EFIX: Exact Fixed Point Methods for Distributed Optimization (available as arXiv preprint) | 2020-12-10 | Paper |
Distributed Second-Order Methods With Increasing Number of Working Nodes IEEE Transactions on Automatic Control | 2020-10-07 | Paper |
LSOS: Line-search Second-Order Stochastic optimization methods for nonconvex finite sums (available as arXiv preprint) | 2020-07-31 | Paper |
Subsampled nonmonotone spectral gradient methods Communications in Applied and Industrial Mathematics | 2020-05-12 | Paper |
Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation Numerical Algorithms | 2020-01-29 | Paper |
Exact spectral-like gradient method for distributed optimization Computational Optimization and Applications | 2019-12-19 | Paper |
Spectral projected gradient method for stochastic optimization Journal of Global Optimization | 2019-03-18 | Paper |
Distributed Gradient Methods with Variable Number of Working Nodes IEEE Transactions on Signal Processing | 2019-02-08 | Paper |
Variable sample size method for equality constrained optimization problems Optimization Letters | 2018-05-28 | Paper |
Distributed second order methods with increasing number of working nodes (available as arXiv preprint) | 2017-09-05 | Paper |
Newton-like method with diagonal correction for distributed optimization SIAM Journal on Optimization | 2017-07-11 | Paper |
Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems Optimization | 2016-03-08 | Paper |
Nonmonotone line search methods with variable sample size Numerical Algorithms | 2015-04-16 | Paper |
Line search methods with variable sample size for unconstrained optimization Journal of Computational and Applied Mathematics | 2013-04-22 | Paper |
SLiSeS: Subsampled Line Search Spectral Gradient Method for Finite Sums (available as arXiv preprint) | N/A | Paper |
A non-monotone trust-region method with noisy oracles and additional sampling (available as arXiv preprint) | N/A | Paper |