Uniform and monotone line sum optimization
From MaRDI portal
Publication:2028097
DOI10.1016/J.DAM.2021.04.008zbMATH Open1469.90124arXiv2011.09932OpenAlexW3159026262MaRDI QIDQ2028097FDOQ2028097
Authors: Martin Koutecký, Shmuel Onn 
Publication date: 31 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: The {em line sum optimization problem} asks for a -matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {em uniform} problem, with identical row functions and identical column functions, and the {em monotone} problem, over matrices with nonincreasing row and column sums, are polynomial time solvable.
Full work available at URL: https://arxiv.org/abs/2011.09932
Recommendations
- Convexification and monotone optimization
- scientific article; zbMATH DE number 3947995
- Unicity in linear optimization
- Convex optimization and monotonic variational inequalities
- Linear optimization with cones of moments and nonnegative polynomials
- Optimization of linear-convex programs
- Practical piecewise-linear approximation for monotropic optimization
- Efficiency and the uniform linear minorization of convex functions
- scientific article; zbMATH DE number 27648
- scientific article; zbMATH DE number 3273621
Cites Work
- Inequalities: theory of majorization and its applications
- Combinatorial matrix classes
- Title not available (Why is that?)
- Minconvex Factors of Prescribed Size in Graphs
- Title not available (Why is that?)
- Combinatorial Properties of Matrices of Zeros and Ones
- Optimization over degree sequences of graphs
- Optimization over degree sequences
- On line sum optimization
Cited In (2)
This page was built for publication: Uniform and monotone line sum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028097)
