A Global Approach for Solving Edge-Matching Puzzles

DOI10.1137/140987869zbMath1320.90113arXiv1409.5957OpenAlexW2058174631MaRDI QIDQ5250017

No author found.

Publication date: 15 May 2015

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.5957

zbMATH Keywords

convex optimizationrelaxationpolynomial systemsedge-matching puzzles

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Related Items

A new mathematical model for tiling finite regions of the plane with polyominoes

Uses Software

• Mosek
• LMIRank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• A Newton-like method for solving rank constrained linear matrix inequalities
• Equality relating Euclidean distance cone to positive semidefinite cone
• Some tapas of computer algebra
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• The Approach of Moments for Polynomial Equations
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science