Sampling-based methods for multi-block optimization problems over transport polytopes
From MaRDI portal
Cites work
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
- A homogenized model for vortex sheets
- A Mathematical Theory of Communication
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification
- An efficient multigrid strategy for large-scale molecular mechanics optimization
- Approximation of optimal transport problems with marginal moments constraints
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Computational optimal transport. With applications to data sciences
- Concerning nonnegative matrices and doubly stochastic matrices
- Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation
- Convex relaxation approaches for strictly correlated density functional theory
- Coordinate descent algorithms
- Density Functional Theory
- Density functional theory and optimal transportation with Coulomb cost
- Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Fast computation of low-rank matrix approximations
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3099866 (Why is no real title available?)
- Inertial stochastic PALM and applications in machine learning
- Intrinsic sparsity of Kantorovich solutions
- Monte Carlo strategies in scientific computing.
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Multigrid Optimization Schemes for Solving Bose–Einstein Condensate Control Problems
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- Multimarginal Optimal Transport Maps for One–dimensional Repulsive Costs
- Nonlinear programming
- Numerical methods for matching for teams and Wasserstein barycenters
- On Information and Sufficiency
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- On the efficiency of random permutation for ADMM and coordinate descent
- Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators With Massive Data
- Optimal subsampling for large-scale quantile regression
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Recovering PCA and sparse PCA via hybrid-(_1,_2) sparse sampling of data elements
- Sampled Gromov Wasserstein
- Sampling With Replacement vs Poisson Sampling: A Comparative Study in Optimal Subsampling
- Semidefinite relaxation of multimarginal optimal transport for strictly correlated electrons in second quantization
- Splitting Methods in Communication, Imaging, Science, and Engineering
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- The cyclic block conditional gradient method for convex optimization problems
- The Monge–Kantorovitch mass transfer and its computational fluid mechanics formulation
Cited in
(3)
This page was built for publication: Sampling-based methods for multi-block optimization problems over transport polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027576)
