M. Takáč

From MaRDI portal
(Redirected from Person:263211)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Exploring new frontiers in vertical federated learning: the role of saddle point reformulation
Journal of Optimization Theory and Applications
2026-03-31Paper
FLECS: a federated learning second-order framework via compression and sketching
Optimization Methods & Software
2025-11-01Paper
Distributed learning with compressed gradient differences
Optimization Methods & Software
2025-11-01Paper
Inexact tensor methods and their application to stochastic convex optimization
Optimization Methods & Software
2024-08-12Paper
Stochastic gradient methods with preconditioned updates
Journal of Optimization Theory and Applications
2024-05-14Paper
Random-reshuffled SARAH does not need full gradient computations
Optimization Letters
2024-03-27Paper
Preconditioning meets biased compression for efficient distributed optimization
Computational Management Science
2024-02-06Paper
Stochastic Gradient Descent with Preconditioned Polyak Step-size2023-10-03Paper
Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness2023-09-04Paper
Convergence analysis of stochastic gradient descent with adaptive preconditioning for non-convex and convex functions2023-08-27Paper
Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes
EURO Journal on Computational Optimization
2023-07-12Paper
Hybrid Methods in Polynomial Optimisation2023-05-25Paper
Cubic Regularization is the Key! The First Accelerated Quasi-Newton Method with a Global Convergence Rate of $O(k^{-2})$ for Convex Functions2023-02-09Paper
Quasi-Newton methods for machine learning: forget the past, just sample
Optimization Methods & Software
2022-12-20Paper
A Damped Newton Method Achieves Global $O\left(\frac{1}{k^2}\right)$ and Local Quadratic Convergence Rate2022-10-31Paper
Effects of momentum scaling for SGD2022-10-21Paper
FLECS: A Federated Learning Second-Order Framework via Compression and Sketching2022-06-04Paper
Randomized sketch descent methods for non-separable linearly constrained optimization
IMA Journal of Numerical Analysis
2022-05-17Paper
Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
Optimization and Engineering
2022-04-22Paper
The Power of First-Order Smooth Optimization for Black-Box Non-Smooth Problems2022-01-28Paper
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences
Computational Optimization and Applications
2021-08-09Paper
An accelerated communication-efficient primal-dual optimization framework for structured machine learning
Optimization Methods & Software
2021-04-15Paper
Inexact SARAH algorithm for stochastic optimization
Optimization Methods & Software
2021-04-15Paper
Inexact Tensor Methods and Their Application to Stochastic Convex Optimization2020-12-31Paper
A class of parallel doubly stochastic algorithms for large-scale learning
(available as arXiv preprint)
2020-10-05Paper
A class of parallel doubly stochastic algorithms for large-scale learning2020-10-05Paper
Stochastic reformulations of linear systems: algorithms and convergence theory
SIAM Journal on Matrix Analysis and Applications
2020-05-28Paper
New Convergence Aspects of Stochastic Gradient Algorithms2020-02-07Paper
New Convergence Aspects of Stochastic Gradient Algorithms
(available as arXiv preprint)
2020-02-07Paper
A robust multi-batch L-BFGS method for machine learning
Optimization Methods & Software
2019-11-25Paper
Quasi-Newton Methods for Machine Learning: Forget the Past, Just Sample
(available as arXiv preprint)
2019-01-28Paper
scientific article; zbMATH DE number 6982986 (Why is no real title available?)2018-11-22Paper
scientific article; zbMATH DE number 6982986 (Why is no real title available?)
(available as arXiv preprint)
2018-11-22Paper
Matrix completion under interval uncertainty
European Journal of Operational Research
2018-05-24Paper
On the complexity of parallel coordinate descent
Optimization Methods & Software
2018-05-02Paper
Entropy Penalized Semidefinite Programming2018-02-12Paper
Projected semi-stochastic gradient descent method with mini-batch scheme under weak strong convexity assumption
(available as arXiv preprint)
2018-02-06Paper
Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization2018-01-25Paper
Distributed optimization with arbitrary local solvers
Optimization Methods & Software
2017-11-24Paper
A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
Optimization Methods & Software
2017-11-24Paper
A Coordinate-Descent Algorithm for Tracking Solutions in Time-Varying Optimal Power Flows2017-10-19Paper
Linear convergence of randomized feasible descent methods under the weak strong convexity assumption2017-01-05Paper
Linear convergence of randomized feasible descent methods under the weak strong convexity assumption
(available as arXiv preprint)
2017-01-05Paper
On optimal probabilities in stochastic coordinate descent methods
Optimization Letters
2016-09-21Paper
A Class of Parallel Doubly Stochastic Algorithms for Large-Scale Learning
(available as arXiv preprint)
2016-06-15Paper
Distributed coordinate descent method for learning with big data
Journal of Machine Learning Research (JMLR)
2016-06-06Paper
Distributed coordinate descent method for learning with big data
Journal of Machine Learning Research (JMLR)
2016-06-06Paper
Parallel coordinate descent methods for big data optimization
Mathematical Programming. Series A. Series B
2016-04-04Paper
Distributed block coordinate descent for minimizing partially separable functions
Numerical Analysis and Optimization
2016-01-05Paper
Hybrid Methods in Solving Alternating-Current Optimal Power Flows2015-10-07Paper
Efficient serial and parallel coordinate descent methods for huge-scale truss topology design
Operations Research Proceedings
2015-03-03Paper
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Mathematical Programming. Series A. Series B
2014-06-02Paper
Sensitivity analysis of the early exercise boundary for American style of Asian option
International Journal of Numerical Analysis and Modeling. Series B
2012-07-16Paper
scientific article; zbMATH DE number 1090096 (Why is no real title available?)1998-04-03Paper
Exploiting higher-order derivatives in convex optimization methods
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: M. Takáč