Time-integrated Optimal Transport: A Robust Minimax Framework
Fuente:
arXiv
Saved in:
| Main Authors: | Nguyen, Thai P. D., Chu, Hong T. M., Toh, Kim-Chuan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)
by: Hu, Yaling, et al.
Published: (2026)
A Dual Method for Minimax Quadratic Programming
by: Ren, Wenhui, et al.
Published: (2025)
by: Ren, Wenhui, et al.
Published: (2025)
Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
by: Ma, Bohao, et al.
Published: (2026)
by: Ma, Bohao, et al.
Published: (2026)
Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)
by: Briceño-Arias, Luis, et al.
Published: (2024)
A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
by: Lu, Zhaosong, et al.
Published: (2025)
by: Lu, Zhaosong, et al.
Published: (2025)
A first-order augmented Lagrangian method for constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2023)
by: Lu, Zhaosong, et al.
Published: (2023)
First-order penalty methods for bilevel optimization
by: Lu, Zhaosong, et al.
Published: (2023)
by: Lu, Zhaosong, et al.
Published: (2023)
Solving bilevel optimization via sequential minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)
by: Lu, Zhaosong, et al.
Published: (2025)
A first-order method for nonconvex-strongly-concave constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)
by: Lu, Zhaosong, et al.
Published: (2025)
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)
by: Li, Wenjing, et al.
Published: (2023)
Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)
by: Turan, Evren M., et al.
Published: (2023)
Difference of Convex (DC) approach for neural network approximation with uniform loss function
by: Peiris, Vinesha, et al.
Published: (2026)
by: Peiris, Vinesha, et al.
Published: (2026)
A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)
by: Yang, Lei, et al.
Published: (2023)
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)
by: Latafat, Puya, et al.
Published: (2023)
Adaptive proximal gradient methods are universal without approximation
by: Oikonomidis, Konstantinos A., et al.
Published: (2024)
by: Oikonomidis, Konstantinos A., et al.
Published: (2024)
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)
by: Latafat, Puya, et al.
Published: (2023)
A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)
by: Kempke, Nils-Christian, et al.
Published: (2024)
Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)
by: Asgari, Kamiar, et al.
Published: (2023)
A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)
by: Hou, Di, et al.
Published: (2023)
Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)
by: Bakhurin, Sergey, et al.
Published: (2022)
Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)
by: Ras, Charl, et al.
Published: (2024)
Active set identification and rapid convergence for degenerate primal-dual problems
by: Díaz, Mateo, et al.
Published: (2026)
by: Díaz, Mateo, et al.
Published: (2026)
Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)
by: Burgard, Jan Pablo, et al.
Published: (2024)
Continuous models combining slacks-based measures of efficiency and super-efficiency
by: Bolos, Vicente J., et al.
Published: (2024)
by: Bolos, Vicente J., et al.
Published: (2024)
On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)
by: He, Jiahuan, et al.
Published: (2023)
Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)
by: Xie, Xiyuan, et al.
Published: (2025)
Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients
by: Müller, Johannes, et al.
Published: (2024)
by: Müller, Johannes, et al.
Published: (2024)
A Bregman ADMM for Bethe variational problem
by: Khoo, Yuehaw, et al.
Published: (2025)
by: Khoo, Yuehaw, et al.
Published: (2025)
Bivariate rational approximations of the general temperature integral
by: Aghili, Alireza, et al.
Published: (2024)
by: Aghili, Alireza, et al.
Published: (2024)
A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
by: Xie, Pengcheng, et al.
Published: (2023)
by: Xie, Pengcheng, et al.
Published: (2023)
Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)
by: Zhou, Juan, et al.
Published: (2024)
Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
by: Shabani, Shima, et al.
Published: (2025)
by: Shabani, Shima, et al.
Published: (2025)
Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
by: Gebrie, Anteneh Getachew
Published: (2023)
by: Gebrie, Anteneh Getachew
Published: (2023)
Fast projection onto the top-k-sum constraint
by: Pan, Jianting, et al.
Published: (2025)
by: Pan, Jianting, et al.
Published: (2025)
A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)
by: Qiu, Songqiang, et al.
Published: (2023)
Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)
by: Burgard, Jan Pablo, et al.
Published: (2024)
A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)
by: Krejic, Natasa, et al.
Published: (2023)
A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)
by: Lin, Yizun, et al.
Published: (2024)
Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
by: Saadati, Maryam, et al.
Published: (2022)
by: Saadati, Maryam, et al.
Published: (2022)
Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)
by: Deng, Kangkang, et al.
Published: (2024)
Similar Items
-
Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026) -
A Dual Method for Minimax Quadratic Programming
by: Ren, Wenhui, et al.
Published: (2025) -
Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
by: Ma, Bohao, et al.
Published: (2026) -
Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024) -
A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
by: Lu, Zhaosong, et al.
Published: (2025)