Image de couverture de livre

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hikima, Yuya, Akagi, Yasunori, Kim, Hideaki
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 65K05, 90C15, 90C30, 05C21 G.1.6; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Zeroth-order gradient estimators for stochastic problems with decision-dependent distributions
par: Hikima, Yuya, et autres
Publié: (2025)

Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent Distributions
par: Hikima, Yuya, et autres
Publié: (2024)

Stochastic Approach for Price Optimization Problems with Decision-dependent Uncertainty
par: Hikima, Yuya, et autres
Publié: (2023)

An inexact infeasible arc-search interior-point method for linear optimization problems
par: Iida, Einosuke, et autres
Publié: (2024)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
par: Iida, Einosuke, et autres
Publié: (2023)

Nonlinear PageRank Problem for Local Graph Partitioning
par: Kodsi, Costy, et autres
Publié: (2024)

A Primal-Dual Frank-Wolfe Algorithm for Linear Programming
par: Hough, Matthew, et autres
Publié: (2024)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
par: Alpay, Faruk, et autres
Publié: (2025)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
par: Gao, Yan, et autres
Publié: (2025)

Active set identification and rapid convergence for degenerate primal-dual problems
par: Díaz, Mateo, et autres
Publié: (2026)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
par: Alpay, Faruk, et autres
Publié: (2025)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
par: Warme, David M.
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
par: Warme, David M.
Publié: (2024)

Gradient Descent Methods for Regularized Optimization
par: Nikolovski, Filip, et autres
Publié: (2024)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
par: Zhu, Wenqi, et autres
Publié: (2026)

Where's Ben Nevis? A 2D optimisation benchmark with 957,174 local optima based on Great Britain terrain data
par: Wei, Yuhang, et autres
Publié: (2024)

Data-Dependent Complexity of First-Order Methods for Binary Classification
par: Hough, Matthew, et autres
Publié: (2025)

Projections onto Spectral Matrix Cones
par: Cederberg, Daniel, et autres
Publié: (2025)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
par: Halemane, Keshava Prasad
Publié: (2014)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
par: Morinaga, Daiki, et autres
Publié: (2022)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
par: Bui, Quang Minh, et autres
Publié: (2022)

Majorization-Minimization-Based Levenberg--Marquardt Method for Constrained Nonlinear Least Squares
par: Marumo, Naoki, et autres
Publié: (2020)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
par: Aref, Samin, et autres
Publié: (2025)

An efficient asymptotic DC method for sparse and low-rank matrix recovery
par: Ding, Mingcai, et autres
Publié: (2024)

Enhancing Model Based Derivative Free Optimization using Direct Search
par: Li, Zijun, et autres
Publié: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints
par: Krejić, Nataša, et autres
Publié: (2025)

Adam symmetry theorem: characterization of the convergence of the stochastic Adam optimizer
par: Dereich, Steffen, et autres
Publié: (2025)

Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method
par: Dereich, Steffen, et autres
Publié: (2026)

Sufficient Conditions for Error Distance Reduction in the (\ell^2)-norm Trust Region between Minimizers of Local Nonconvex Multivariate Quadratic Approximates
par: Xie, Pengcheng
Publié: (2023)

On the characterization of graphs with tree 3-spanners
par: Lin, Lan, et autres
Publié: (2025)

Quadratic Surrogate Attractor for Particle Swarm Optimization
par: Clemente, Maurizio, et autres
Publié: (2026)

A Polyhedral Perspective on the Perfect Matching Lattice
par: Silina, Olha
Publié: (2025)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

OpenSQP: A Reconfigurable Open-Source SQP Algorithm in Python for Nonlinear Optimization
par: Joshy, Anugrah Jo, et autres
Publié: (2025)

Refining Graphical Neural Network Predictions Using Flow Matching for Optimal Power Flow with Constraint-Satisfaction Guarantee
par: Khanal, Kshitiz
Publié: (2025)

ASMOP: Additional sampling stochastic trust region method for multi-objective problems
par: Jerinkić, Nataša Krklec, et autres
Publié: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
par: Hu, Yaling, et autres
Publié: (2026)

Folding Mixed-Integer Linear Programs and Reflection Symmetries
par: van der Hulst, Rolf
Publié: (2026)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)