Panda: partially approximate Newton methods for distributed minimax optimization with unbalanced dimensions
From MaRDI portal
Cites work
- 10.1162/153244303321897726
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Approximate Newton methods
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis
- Distributionally Robust Stochastic Optimization with Wasserstein Distance
- Extensions of Lipschitz mappings into a Hilbert space
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Greedy quasi-Newton methods with explicit superlinear convergence
- Hessian averaging in stochastic Newton methods achieves superlinear convergence
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Low-rank approximation and regression in input sparsity time
- Nesterov's acceleration for approximate Newton
- Projected reflected gradient methods for monotone variational inequalities
- Robust optimization-methodology and applications
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Sub-sampled Newton methods
- Subgradient methods for saddle-point problems
This page was built for publication: Panda: partially approximate Newton methods for distributed minimax optimization with unbalanced dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903669)