{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:14:59Z","timestamp":1783106099472,"version":"3.54.6"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,7,27]],"date-time":"2014-07-27T00:00:00Z","timestamp":1406419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006461","name":"Citi Foundation, Citigroup","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006461","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["307754"],"award-info":[{"award-number":["307754"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","award":["11-Apr"],"award-info":[{"award-number":["11-Apr"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israeli Ministry of Science"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1284\/12, 764\/10"],"award-info":[{"award-number":["1284\/12, 764\/10"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["331\/10"],"award-info":[{"award-number":["331\/10"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2014,7,27]]},"abstract":"<jats:p>\n            Controlling the singular values of\n            <jats:italic>n<\/jats:italic>\n            -dimensional matrices is often required in geometric algorithms in graphics and engineering. This paper introduces a convex framework for problems that involve singular values. Specifically, it enables the optimization of functionals and constraints expressed in terms of the extremal singular values of matrices.\n          <\/jats:p>\n          <jats:p>Towards this end, we introduce a family of convex sets of matrices whose singular values are bounded. These sets are formulated using Linear Matrix Inequalities (LMI), allowing optimization with standard convex Semidefinite Programming (SDP) solvers. We further show that these sets are optimal, in the sense that there exist no larger convex sets that bound singular values.<\/jats:p>\n          <jats:p>A number of geometry processing problems are naturally described in terms of singular values. We employ the proposed framework to optimize and improve upon standard approaches. We experiment with this new framework in several applications: volumetric mesh deformations, extremal quasi-conformal mappings in three dimensions, non-rigid shape registration and averaging of rotations. We show that in all applications the proposed approach leads to algorithms that compare favorably to state-of-art algorithms.<\/jats:p>","DOI":"10.1145\/2601097.2601142","type":"journal-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T15:08:20Z","timestamp":1406041700000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Controlling singular values with semidefinite programming"],"prefix":"10.1145","volume":"33","author":[{"given":"Shahar Z.","family":"Kovalsky","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noam","family":"Aigerman","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronen","family":"Basri","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaron","family":"Lipman","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461931"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344859"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566592"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882311"},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Andersen E. D. and Andersen K. D. 1999. The MOSEK interior point optimization for linear programming: an implementation of the homogeneous algorithm. Kluwer Academic Publishers 197--232.  Andersen E. D. and Andersen K. D. 1999. The MOSEK interior point optimization for linear programming: an implementation of the homogeneous algorithm . Kluwer Academic Publishers 197--232.","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073207"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2462014"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Boyd S. and Vandenberghe L. 2004. Convex Optimization. Cambridge University Press New York NY USA.   Boyd S. and Vandenberghe L. 2004. Convex Optimization . Cambridge University Press New York NY USA.","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1112822108"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276404"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115477.3115803"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778775"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_11"},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. In Advances in Multiresolution for Geometric Modelling Springer 157--186.  Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. In Advances in Multiresolution for Geometric Modelling Springer 157--186.","DOI":"10.1007\/3-540-26808-1_9"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.341"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Giorgi D. Biasotti S. and Paraboschi L. 2007. Shape retrieval contest 2007: Watertight models track.  Giorgi D. Biasotti S. and Paraboschi L. 2007. Shape retrieval contest 2007: Watertight models track.","DOI":"10.1109\/SMI.2008.4547975"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_2_2_19_1","volume-title":"Proc. of Congreso Espa\u00f1ol de Inform\u00e1tica Gr\u00e1fica.","author":"Hernandez F."},{"key":"e_1_2_2_20_1","volume-title":"MIPS: An efficient global parametrization method. In Curve and Surface Design: Saint-Malo","author":"Hormann K.","year":"2000"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281500.1281510"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12184"},{"key":"e_1_2_2_23_1","volume-title":"Proc. Eurographics Symposium on Geometry Processing, 1449--1457","author":"Huang Q.-X."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073323"},{"key":"e_1_2_2_25_1","first-page":"379","article-title":"A survey and comparison of contemporary algorithms for computing the matrix geometric mean","volume":"39","author":"Jeuris B.","year":"2012","journal-title":"Electronic Transactions on Numerical Analysis"},{"key":"e_1_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Karcher H. 1977. Riemannian center of mass and mollifier smoothing. Comm. pure and applied mathematics 30 5 509--541.  Karcher H. 1977. Riemannian center of mass and mollifier smoothing. Comm. pure and applied mathematics 30 5 509--541.","DOI":"10.1002\/cpa.3160300502"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104345"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_29_1","first-page":"5","article-title":"Global correspondence optimization for non-rigid registration of depth scans","volume":"27","author":"Li H.","year":"2008","journal-title":"Proc. Eurographics Symposium on Geometry Processing"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185604"},{"key":"e_1_2_2_31_1","series-title":"SIAM J. Imaging Sci., to appear","volume-title":"Bijective mappings of meshes with boundary and the degree in mesh processing","author":"Lipman Y."},{"key":"e_1_2_2_32_1","first-page":"1495","article-title":"A local\/global approach to mesh parameterization","volume":"27","author":"Liu L.","year":"2008","journal-title":"Proc. Eurographics Symposium on Geometry Processing"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/100795097"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/080740544"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2012.03.014"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(82)90087-5"},{"key":"e_1_2_2_38_1","volume-title":"Proc. European Signal Processing Conference, EURASIP, 2229--2233","author":"Rentmeesters Q."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019627.2019635"},{"key":"e_1_2_2_40_1","volume-title":"Int. Conf. 3D Digital Imaging and Modeling.","author":"Rusinkiewicz S."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383307"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12179"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/325165.325242"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.02.001"},{"key":"e_1_2_2_45_1","volume-title":"Proc. Eurographics Symposium on Geometry Processing, 109--116","author":"Sorkine O."},{"key":"e_1_2_2_46_1","volume-title":"Proc. Conference on Visualization '02, VIS '02, 355--362","author":"Sorkine O."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276478"},{"key":"e_1_2_2_48_1","volume-title":"Proc. Eurographics Symposium on Geometry Processing, 1383--1392","author":"Sun J."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866158.1866182"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03173.x"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577078"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601142","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2601097.2601142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:10Z","timestamp":1750231150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,27]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7,27]]}},"alternative-id":["10.1145\/2601097.2601142"],"URL":"https:\/\/doi.org\/10.1145\/2601097.2601142","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,27]]},"assertion":[{"value":"2014-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}