{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:08:56Z","timestamp":1784268536947,"version":"3.55.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005386","name":"I-CORE","doi-asserted-by":"crossref","award":["4\/11"],"award-info":[{"award-number":["4\/11"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1284\/12"],"award-info":[{"award-number":["1284\/12"]}],"id":[{"id":"10.13039\/501100003977","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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2016,7,11]]},"abstract":"<jats:p>We present the Accelerated Quadratic Proxy (AQP) - a simple first-order algorithm for the optimization of geometric energies defined over triangular and tetrahedral meshes.<\/jats:p>\n          <jats:p>The main stumbling block of current optimization techniques used to minimize geometric energies over meshes is slow convergence due to ill-conditioning of the energies at their minima. We observe that this ill-conditioning is in large part due to a Laplacian-like term existing in these energies. Consequently, we suggest to locally use a quadratic polynomial proxy, whose Hessian is taken to be the Laplacian, in order to achieve a preconditioning effect. This already improves stability and convergence, but more importantly allows incorporating acceleration in an almost universal way, that is independent of mesh size and of the specific energy considered.<\/jats:p>\n          <jats:p>\n            Experiments with AQP show it is rather insensitive to mesh resolution and requires a nearly constant number of iterations to converge; this is in strong contrast to other popular optimization techniques used today such as Accelerated Gradient Descent and Quasi-Newton methods,\n            <jats:italic>e.g.<\/jats:italic>\n            , L-BFGS. We have tested AQP for mesh deformation in 2D and 3D as well as for surface parameterization, and found it to provide a considerable speedup over common baseline techniques.\n          <\/jats:p>","DOI":"10.1145\/2897824.2925920","type":"journal-article","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T16:04:33Z","timestamp":1468253073000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["Accelerated quadratic proxy for geometric optimization"],"prefix":"10.1145","volume":"35","author":[{"given":"Shahar Z.","family":"Kovalsky","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meirav","family":"Galun","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":[[2016,7,11]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766921"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/280814.280821"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531340"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.1054"},{"key":"e_1_2_2_6_1","volume-title":"Symposium on Geometry Processing, no. EPFL-CONF-149310","author":"Botsch M.","unstructured":"Botsch , M. , Pauly , M. , Gross , M. H. , and Kobbelt , L . 2006. Primo: coupled prisms for intuitive surface modeling . In Symposium on Geometry Processing, no. EPFL-CONF-149310 , 11--20. Botsch, M., Pauly, M., Gross, M. H., and Kobbelt, L. 2006. Primo: coupled prisms for intuitive surface modeling. In Symposium on Geometry Processing, no. EPFL-CONF-149310, 11--20."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778775"},{"key":"e_1_2_2_8_1","volume-title":"-C","author":"Combettes P. L.","year":"2011","unstructured":"Combettes , P. L. , and Pesquet , J . -C . 2011 . Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering. Springer , 185--212. Combettes, P. L., and Pesquet, J.-C. 2011. Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering. Springer, 185--212."},{"key":"e_1_2_2_9_1","first-page":"201","article-title":"An adaptable surface parameterization method","volume":"3","author":"Degener P.","year":"2003","unstructured":"Degener , P. , Meseth , J. , and Klein , R. 2003 . An adaptable surface parameterization method . IMR 3 , 201 -- 213 . Degener, P., Meseth, J., and Klein, R. 2003. An adaptable surface parameterization method. IMR 3, 201--213.","journal-title":"IMR"},{"key":"e_1_2_2_10_1","volume-title":"Computer Graphics Forum","volume":"21","author":"Desbrun M.","unstructured":"Desbrun , M. , Meyer , M. , and Alliez , P . 2002. Intrinsic parameterizations of surface meshes . In Computer Graphics Forum , vol. 21 , Wiley Online Library, 209--218. Desbrun, M., Meyer, M., and Alliez, P. 2002. Intrinsic parameterizations of surface meshes. In Computer Graphics Forum, vol. 21, Wiley Online Library, 209--218."},{"key":"e_1_2_2_11_1","first-page":"206","article-title":"Sobolev gradient type preconditioning for the saint-venant model of elasto-plastic torsion","volume":"5","author":"Farago I.","year":"2008","unstructured":"Farago , I. , and Karatson , J. 2008 . Sobolev gradient type preconditioning for the saint-venant model of elasto-plastic torsion . Int. J. Numer. Anal. Model 5 , 2, 206 -- 221 . Farago, I., and Karatson, J. 2008. Sobolev gradient type preconditioning for the saint-venant model of elasto-plastic torsion. Int. J. Numer. Anal. Model 5, 2, 206--221.","journal-title":"Int. J. Numer. Anal. Model"},{"key":"e_1_2_2_12_1","unstructured":"Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. Advances in multiresolution for geometric modelling 1 1.  Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. Advances in multiresolution for geometric modelling 1 1."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766938"},{"key":"e_1_2_2_14_1","volume-title":"Discrete Shells. In ACM SIGGRAPH \/ Eurographics Symposium on Computer Animation, 62--67","author":"Grinspun E.","unstructured":"Grinspun , E. , Hirani , A. , Desbrun , M. , and Schr\u00f6der , P . 2003 . Discrete Shells. In ACM SIGGRAPH \/ Eurographics Symposium on Computer Animation, 62--67 . Grinspun, E., Hirani, A., Desbrun, M., and Schr\u00f6der, P. 2003. Discrete Shells. In ACM SIGGRAPH \/ Eurographics Symposium on Computer Animation, 62--67."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019627.2019638"},{"key":"e_1_2_2_16_1","volume-title":"Mips: An efficient global parametrization method. Tech. rep., DTIC Document.","author":"Hormann K.","year":"2000","unstructured":"Hormann , K. , and Greiner , G . 2000 . Mips: An efficient global parametrization method. Tech. rep., DTIC Document. Hormann, K., and Greiner, G. 2000. Mips: An efficient global parametrization method. Tech. rep., DTIC Document."},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1142003"},{"key":"e_1_2_2_18_1","volume-title":"Computer Graphics Forum","volume":"28","author":"Huang Q.-X.","unstructured":"Huang , Q.-X. , Wicke , M. , Adams , B. , and Guibas , L . 2009. Shape decomposition using modal analysis . In Computer Graphics Forum , vol. 28 , Wiley Online Library, 407--416. Huang, Q.-X., Wicke, M., Adams, B., and Guibas, L. 2009. Shape decomposition using modal analysis. In Computer Graphics Forum, vol. 28, Wiley Online Library, 407--416."},{"key":"e_1_2_2_19_1","volume-title":"A first course in the numerical analysis of differential equations. No. 44","author":"Iserles A.","unstructured":"Iserles , A. 2009. A first course in the numerical analysis of differential equations. No. 44 . Cambridge University Press . Iserles, A. 2009. A first course in the numerical analysis of differential equations. No. 44. Cambridge University Press."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073229"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601142"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818098"},{"key":"e_1_2_2_23_1","unstructured":"Lee J. Sun Y. and Saunders M. 2012. Proximal newton-type methods for convex optimization. In Advances in Neural Information Processing Systems 836--844.  Lee J. Sun Y. and Saunders M. 2012. Proximal newton-type methods for convex optimization. In Advances in Neural Information Processing Systems 836--844."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_25_1","unstructured":"Li H. and Lin Z. 2015. Accelerated proximal gradient methods for nonconvex programming. In Advances in Neural Information Processing Systems 379--387.   Li H. and Lin Z. 2015. Accelerated proximal gradient methods for nonconvex programming. In Advances in Neural Information Processing Systems 379--387."},{"key":"e_1_2_2_26_1","volume-title":"Computer Graphics Forum","volume":"27","author":"Liu L.","unstructured":"Liu , L. , Zhang , L. , Xu , Y. , Gotsman , C. , and Gortler , S. J . 2008. A local\/global approach to mesh parameterization . In Computer Graphics Forum , vol. 27 , Wiley Online Library, 1495--1504. Liu, L., Zhang, L., Xu, Y., Gotsman, C., and Gortler, S. J. 2008. A local\/global approach to mesh parameterization. In Computer Graphics Forum, vol. 27, Wiley Online Library, 1495--1504."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508363.2508406"},{"key":"e_1_2_2_28_1","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o (1\/k2)","volume":"27","author":"Nesterov Y","year":"1983","unstructured":"Nesterov , Y 1983 . A method of solving a convex programming problem with convergence rate o (1\/k2) . In Soviet Mathematics Doklady , vol. 27 , 372 -- 376 . Nesterov, Y 1983. A method of solving a convex programming problem with convergence rate o (1\/k2). In Soviet Mathematics Doklady, vol. 27, 372--376.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_2_2_29_1","unstructured":"Nocedal J. and Wright S. 2006. Numerical optimization. Springer Science & Business Media.  Nocedal J. and Wright S. 2006. Numerical optimization. Springer Science & Business Media."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/130942954"},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Papadopoulo T. and Lourakis M. I. 2000. Estimating the jacobian of the singular value decomposition: Theory and applications. In Computer Vision-ECCV 2000. Springer 554--570.   Papadopoulo T. and Lourakis M. I. 2000. Estimating the jacobian of the singular value decomposition: Theory and applications. In Computer Vision-ECCV 2000. Springer 554--570.","DOI":"10.1007\/3-540-45054-8_36"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_2_2_33_1","first-page":"15","article-title":"The matrix cookbook","volume":"7","author":"Petersen K. B.","year":"2008","unstructured":"Petersen , K. B. , Pedersen , M. S. , 2008 . The matrix cookbook . Technical University of Denmark 7 , 15 . Petersen, K. B., Pedersen, M. S., et al. 2008. The matrix cookbook. Technical University of Denmark 7, 15.","journal-title":"Technical University of Denmark"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00412-X"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818093"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12179"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000011"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629697"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766947"},{"key":"e_1_2_2_41_1","volume-title":"Symposium on Geometry processing","volume":"4","author":"Sorkine O.","unstructured":"Sorkine , O. , and Alexa , M . 2007. As-rigid-as-possible surface modeling . In Symposium on Geometry processing , vol. 4 . Sorkine, O., and Alexa, M. 2007. As-rigid-as-possible surface modeling. In Symposium on Geometry processing, vol. 4."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/378456.378522"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.4208\/cicp.281114.290615a"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766952"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2007.07.006"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925920","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897824.2925920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:04Z","timestamp":1750222504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7,11]]}},"alternative-id":["10.1145\/2897824.2925920"],"URL":"https:\/\/doi.org\/10.1145\/2897824.2925920","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}