Sciweavers

62 search results - page 3 / 13
» Optimal BSR Solutions to Several Convex Polygon Problems
Sort
View
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 1 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
ICIP
2009
IEEE
14 years 7 months ago
Monotone Operator Splitting For Optimization Problems In Sparse Recovery
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
ICCSA
2004
Springer
13 years 11 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
CGF
2008
126views more  CGF 2008»
13 years 6 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
IOR
2008
85views more  IOR 2008»
13 years 6 months ago
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria