Convex solution of a permutation problem

DOI10.1016/J.LAA.2010.08.028MaRDI QIDQ609515zbMATH OpenOpenAlexFDO

Authors Marko Stošić, Manuel Marques, João Paulo Costeira

Publication date 1 December 2010

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2010.08.028

zbMATH Keywords

permutationconvex optimizationcomputer visionPerron-Frobenius theoremdoubly-stochastic matrices

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Stochastic matrices (15B51) Machine vision and scene understanding (68T45)

Recommendations

• scientific article; zbMATH DE number 4149894
• Convex relaxations for permutation problems
• scientific article; zbMATH DE number 4049390
• scientific article; zbMATH DE number 2168903
• The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations

Cited in

(5)

• Finding explicit solutions for linear regression without correspondences based on rearrangement inequality
• The unit-capacity constrained permutation problem
• L_p-norm regularization algorithms for optimization over permutation matrices
• Permutation Problems and Channelling Constraints
• Reconstructing convex permutominoes

This page was built for publication: Convex solution of a permutation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609515)