Imagen de Portada

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jung, Woosuk L., Wolkowicz, Henry
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control 90C26, 65K10, 90C27, 90C22
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Single Element Error Correction/ in a Euclidean Distance Matrix
por: Alfakih, Abdo, et al.
Publicado: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
por: Im, Haesol, et al.
Publicado: (2024)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
por: Qu, Zheng, et al.
Publicado: (2023)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
por: Brosch, Daniel, et al.
Publicado: (2025)

A structured L-BFGS method and its application to inverse problems
por: Mannel, Florian, et al.
Publicado: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
por: Mannel, Florian, et al.
Publicado: (2024)

Separable QCQPs and Their Exact SDP Relaxations
por: Kojima, Masakazu, et al.
Publicado: (2026)

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
por: Song, Mengmeng, et al.
Publicado: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
por: Kojima, Masakazu, et al.
Publicado: (2025)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
por: Niu, Yi-Shuai, et al.
Publicado: (2018)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
por: Lara, Felipe, et al.
Publicado: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
por: Marumo, Naoki
Publicado: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
por: Zhang, Na, et al.
Publicado: (2025)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
por: Dahl, Simeon vom, et al.
Publicado: (2026)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
por: Liu, Zekun
Publicado: (2024)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
por: Turan, Evren M., et al.
Publicado: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
por: Aguirre, Jacob M., et al.
Publicado: (2025)

Error Bounds for Rank-one Double Nonnegative Reformulations of QAP and Exact Penalties
por: Qian, Yitian, et al.
Publicado: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
por: Deng, Kangkang, et al.
Publicado: (2024)

A full splitting algorithm for fractional programs with structured numerators and denominators
por: Boţ, Radu Ioan, et al.
Publicado: (2023)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
por: Han, Deren, et al.
Publicado: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
por: Mannel, Florian
Publicado: (2024)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
por: Krejić, Nataša, et al.
Publicado: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
por: Kojima, Masakazu, et al.
Publicado: (2025)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
por: Singh, Vikram, et al.
Publicado: (2025)

Grassmannian optimization is NP-hard
por: Lai, Zehua, et al.
Publicado: (2024)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
por: Zhao, Lei, et al.
Publicado: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
por: Zhou, Junpeng, et al.
Publicado: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
por: Fest, Jean-Baptiste, et al.
Publicado: (2023)

Practical Experience with Stable Set and Coloring Relaxations
por: Pucher, Dunja, et al.
Publicado: (2024)

Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
por: Wu, Zhongming, et al.
Publicado: (2024)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
por: Lin, Yizun, et al.
Publicado: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
por: Arima, Naohiko, et al.
Publicado: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

A simple iterative algorithm for maxcut
por: Shao, Sihong, et al.
Publicado: (2018)

Continuous iterative algorithms for anti-Cheeger cut
por: Shao, Sihong, et al.
Publicado: (2021)

Splitting the Conditional Gradient Algorithm
por: Woodstock, Zev, et al.
Publicado: (2023)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
por: Tawarmalani, Mohit
Publicado: (2024)