Strongly Convex Optimization for the Dual Formulation of Optimal Transport

No abstract is available for this paper.

• Publication year

  2020

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Engineering

• Identifiers
  DOI 10.1007/978-3-030-58657-7_17
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Revisiting Fixed Support Wasserstein Barycenter: Computational Hardness and Efficient Algorithms

  2020cited by this paper
• On the Complexity of Approximating Wasserstein Barycenter

  2019cited by this paper
• On the Complexity of Approximating Multimarginal Optimal Transport

  2019cited by this paper
• On Primal and Dual Approaches for Distributed Stochastic Convex Optimization over Networks

  2019cited by this paper
• Gradient Methods for Problems with Inexact Model of the Objective

  2019cited by this paper
• Universal Method of Searching for Equilibria and Stochastic Equilibria in Transportation Networks

  2019cited by this paper
• Accelerated Primal-Dual Gradient Descent with Linesearch for Convex, Nonconvex, and Nonsmooth Optimization Problems

  2019cited by this paper
• Alternating minimization methods for strongly convex optimization

  2019cited by this paper
• On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms

  2019cited by this paper
• Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters

  2018cited by this paper
• Alternating Randomized Block Coordinate Descent

  2018cited by this paper
• Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm

  2018cited by this paper
• Distributed Computation of Wasserstein Barycenters Over Networks

  2018cited by this paper
• Restarting the accelerated coordinate descent method with a rough strong convexity estimate

  2018cited by this paper
• Primal–dual accelerated gradient methods with small-dimensional relaxation oracle

  2018cited by this paper
• Optimal Mass Transport: Signal processing and machine-learning applications

  2017cited by this paper
• Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints

  2017cited by this paper
• Geodesic PCA in the Wasserstein space by Convex PCA

  2017cited by this paper
• Adaptive Similar Triangles Method: a Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport

  2017cited by this paper
• Sharpness, Restart and Acceleration

  2017cited by this paper
• Construction of Non-asymptotic Confidence Sets in 2-Wasserstein Space

  2017cited by this paper
• Universal intermediate gradient method for convex problems with inexact oracle

  2017cited by this paper
• Multilevel Clustering via Wasserstein Means

  2017cited by this paper
• Randomized Similar Triangles Method: A Unifying Framework for Accelerated Randomized Optimization Methods (Coordinate Descent, Directional Search, Derivative-Free Method)

  2017cited by this paper
• Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games

  2016cited by this paper
• Convergence of an Alternating Maximization Procedure

  2016cited by this paper
• Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints

  2016cited by this paper
• Amplitude and phase variation of point processes

  2016cited by this paper
• Efficiency of Accelerated Coordinate Descent Method on Structured Optimization Problems

  2016cited by this paper
• A Smoothed Dual Approach for Variational Wasserstein Problems

  2015cited by this paper
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes

  2015cited by this paper
• Universal gradient methods for convex optimization problems

  2015cited by this paper
• Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling

  2015cited by this paper
• Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems

  2015cited by this paper
• Iterative Solution of Nonlinear Equations in Several Variables

  2014cited by this paper
• An Accelerated Proximal Coordinate Gradient Method

  2014cited by this paper
• Wasserstein Propagation for Semi-Supervised Learning

  2014cited by this paper
• Accelerated, Parallel, and Proximal Coordinate Descent

  2013cited by this paper
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization

  2013cited by this paper
• Fast Computation of Wasserstein Barycenters

  2013cited by this paper
• Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems

  2013cited by this paper
• Sinkhorn Distances: Lightspeed Computation of Optimal Transport

  2013cited by this paper
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods

  2013cited by this paper
• On the Convergence of Block Coordinate Descent Type Methods

  2013cited by this paper
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

  2012cited by this paper
• Nonnegative Matrix Factorization with Earth Mover's Distance Metric for Image Analysis

  2011cited by this paper
• Barycenters in the Wasserstein Space

  2011cited by this paper
• Optimal Transport: Old and New

  2008cited by this paper
• Iteratively reweighted least squares minimization for sparse recovery

  2008cited by this paper
• Smooth minimization of non-smooth functions

  2005cited by this paper
• Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach

  2005cited by this paper
• Generalized Linear Models

  2002cited by this paper
• The Earth Mover's Distance as a Metric for Image Retrieval

  2000cited by this paper
• The EM algorithm and extensions

  1996cited by this paper
• Generalized Linear Models, 2nd Edn.

  1990cited by this paper
• Parallel and distributed computation

  1989cited by this paper
• A distance metric for multidimensional histograms

  1985cited by this paper
• Diagonal equivalence to matrices with prescribed row and column sums. II

  1974cited by this paper

• Поиск равновесий в двухстадийных моделях распределения транспортных потоков по сети

  2021cites this paper
• Finding equilibrium in two-stage traffic assignment model

  2020cites this paper