{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T19:15:15Z","timestamp":1774898115009,"version":"3.50.1"},"reference-count":83,"publisher":"Emerald","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,11,24]]},"abstract":"<jats:p>Structured optimization uses a prescribed set of atoms to assemble a solution that fits a model to data. Polarity, which extends the familiar notion of orthogonality from linear sets to general convex sets, plays a special role in a simple and geometric form of convex duality. This duality correspondence yields a general notion of alignment that leads to an intuitive and complete description of how atoms participate in the final decomposition of the solution. The resulting geometric perspective leads to variations of existing algorithms effective for large-scale problems. We illustrate these ideas with many examples, including applications in matrix completion and morphological component analysis for the separation of mixtures of signals.<\/jats:p>","DOI":"10.1561\/2400000028","type":"journal-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T08:14:46Z","timestamp":1606205686000},"page":"280-366","source":"Crossref","is-referenced-by-count":6,"title":["Atomic Decomposition via Polar Alignment"],"prefix":"10.1561","volume":"3","author":[{"given":"Zhenan","family":"Fan","sequence":"first","affiliation":[{"name":"University of British Columbia ,","place":["Canada"]}]},{"given":"Halyun","family":"Jeong","sequence":"additional","affiliation":[{"name":"University of British Columbia ,","place":["Canada"]}]},{"given":"Yifan","family":"Sun","sequence":"additional","affiliation":[{"name":"Stony Brook University ,","place":["USA"]}]},{"given":"Michael P.","family":"Friedlander","sequence":"additional","affiliation":[{"name":"University of British Columbia ,","place":["Canada"]}]}],"member":"140","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"2026033014421881300_ref001","volume-title":"Systems Optimization Laboratory. Tech. Rep. 83\u201320R, Department of Management Science and Engineering","author":"Murtagh","year":"1983"},{"issue":"1","key":"2026033014421881300_ref002","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","article-title":"Atomic decomposition by basis pursuit","volume":"20","author":"Chen","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2026033014421881300_ref003","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","article-title":"Atomic decomposition by basis pursuit","volume":"43","author":"Chen","year":"2001","journal-title":"SIAM Rev."},{"issue":"2","key":"2026033014421881300_ref004","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Cand\u00e8s","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026033014421881300_ref005","first-page":"267","article-title":"Regression shrinkage and selection via the lasso","volume-title":"J. Royal Stat. Soc. Ser. B","author":"Tibshirani","year":"1996"},{"issue":"4","key":"2026033014421881300_ref006","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/(SICI)1097-0258(19970228)16:4<385::AID-SIM380>3.0.CO;2-3","article-title":"The lasso method for variable selection in the Cox model","volume":"16","author":"Tibshirani","year":"1997","journal-title":"Stat. Med."},{"key":"2026033014421881300_ref007","unstructured":"L.\n              Vandenberghe\n            \n          , \u201cThe CVXOPT linear and quadratic cone program solvers\u201d, 2010. [Online]. Available:http:\/\/www.seas.ucla.edu\/~vandenbe\/publications\/coneprog.pdf."},{"issue":"1","key":"2026033014421881300_ref008","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/15M104726X","article-title":"An extended Frank-Wolfe method with \u2018in-face\u2019 directions, and its application to low-rank matrix completion","volume":"27","author":"Freund","year":"2017","journal-title":"SIAM J. Optim."},{"key":"2026033014421881300_ref009","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"Negahban","year":"2012","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"2026033014421881300_ref010","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1137\/0322061","article-title":"Two-metric projection methods for constrained optimization","volume":"22","author":"Gafni","year":"1984","journal-title":"SIAM J. Control Optim."},{"key":"2026033014421881300_ref011","first-page":"433","volume-title":"Group lasso with overlap and graph lasso","author":"Jacob","year":"2009"},{"issue":"3","key":"2026033014421881300_ref012","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","article-title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","volume":"52","author":"Recht","year":"2010","journal-title":"SIAM Rev."},{"key":"2026033014421881300_ref013","volume-title":"The ordered weighted \u21131 norm: Atomic formulation, projections, and algorithms","author":"Zeng","year":"2014"},{"issue":"3","key":"2026033014421881300_ref014","first-page":"123","article-title":"Proximal algorithms","volume":"1","author":"Parikh","year":"2013","journal-title":"Foundations and Trends in Optimization"},{"issue":"1","key":"2026033014421881300_ref015","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","article-title":"An algorithm for quadratic programming","volume":"3","author":"Frank","year":"1956","journal-title":"Naval Research Logistics (NRL)"},{"issue":"2","key":"2026033014421881300_ref016","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/0022-247X(78)90137-3","article-title":"Conditional gradient algorithms with open loop step size rules","volume":"62","author":"Dunn","year":"1978","journal-title":"J. Math. Anal. Appl."},{"key":"2026033014421881300_ref017","first-page":"427","volume-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"Jaggi","year":"2013"},{"key":"2026033014421881300_ref018","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-468662-5.50015-X","volume-title":"Nonlinear Programming 4","author":"Lemarechal","year":"1981"},{"key":"2026033014421881300_ref019","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"Xiao","year":"2010","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"2026033014421881300_ref020","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TAC.2011.2161027","article-title":"Dual averaging for distributed optimization: Convergence analysis and network scaling","volume":"57","author":"Duchi","year":"2012","journal-title":"IEEE Trans. Automat. Control"},{"key":"2026033014421881300_ref021","first-page":"302","volume-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"2026033014421881300_ref022","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Nesterov","year":"1994"},{"key":"2026033014421881300_ref023","volume-title":"Ser. MPS\/SIAM Series on Optimization","author":"Renegar","year":"2001"},{"key":"2026033014421881300_ref024","first-page":"284","volume-title":"Yalmip: A toolbox for modeling and optimization in matlab","author":"Lofberg","year":"2004"},{"key":"2026033014421881300_ref025","unstructured":"M.\n              Grant\n             and S.Boyd, CVX: Matlab Software for Disciplined Convex Programming (Web Page and Software), http:\/\/cvxr.com, 2009."},{"issue":"3","key":"2026033014421881300_ref026","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","article-title":"A spectral bundle method for semidefinite programming","volume":"10","author":"Helmberg","year":"2000","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2026033014421881300_ref027","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02591851","article-title":"Dual gauge programs, with applications to quadratic programming and the minimum-norm problem","volume":"38","author":"Freund","year":"1987","journal-title":"Math. Program"},{"issue":"4","key":"2026033014421881300_ref028","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1137\/130940785","article-title":"Gauge optimization and duality","volume":"24","author":"Friedlander","year":"2014","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2026033014421881300_ref029","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s002110050050","article-title":"An iterative two-step algorithm for linear complementarity problems","volume":"68","author":"Kocvara","year":"1994","journal-title":"Numerische Mathematik"},{"issue":"2","key":"2026033014421881300_ref030","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10957-016-1024-9","article-title":"A two-stage active-set algorithm for bound-constrained optimization","volume":"172","author":"Cristofari","year":"2017","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2026033014421881300_ref031","first-page":"251","article-title":"Identifying active constraints via partial smoothness and prox-regularity","volume":"11","author":"Hare","year":"2004","journal-title":"J. Convex Anal."},{"key":"2026033014421881300_ref032","doi-asserted-by":"crossref","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"Z\u0103linescu","year":"2002"},{"key":"2026033014421881300_ref033","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"Bauschke","year":"2011"},{"issue":"6","key":"2026033014421881300_ref034","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","article-title":"The convex geometry of linear inverse problems","volume":"12","author":"Chandrasekaran","year":"2012","journal-title":"Found. Comput. Math."},{"key":"2026033014421881300_ref035","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"2026033014421881300_ref036","first-page":"205","volume-title":"Univ. Tomsk. Rev. Ser. Collected Works","author":"von Neumann","year":"1962"},{"issue":"1","key":"2026033014421881300_ref037","first-page":"173","article-title":"The convex analysis of unitarily invariant matrix functions","volume":"2","author":"Lewis","year":"1995","journal-title":"J. Convex Anal."},{"issue":"3","key":"2026033014421881300_ref038","doi-asserted-by":"crossref","first-page":"A1616","DOI":"10.1137\/15M1034283","article-title":"Low-rank spectral optimization via gauge duality","volume":"38","author":"Friedlander","year":"2016","journal-title":"SIAM J. Sci. Comput."},{"key":"2026033014421881300_ref039","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"Hiriart-Urruty","year":"2001"},{"key":"2026033014421881300_ref040","volume-title":"Convex Optimization Theory","author":"Bertsekas","year":"2009"},{"key":"2026033014421881300_ref041","first-page":"2477","volume-title":"Sparse solutions to linear inverse problems with multiple measurement vectors","author":"Cotter","year":"2005"},{"issue":"4","key":"2026033014421881300_ref042","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0013-4694(95)00107-A","article-title":"Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm","volume":"95","author":"Gorodnitsky","year":"1995","journal-title":"Electroencephalography and Clinical Neurophysiology"},{"key":"2026033014421881300_ref043","first-page":"281","volume-title":"R 1-PCA: Rotational invariant L1-norm principal component analysis for robust subspace factorization","author":"Ding","year":"2006"},{"key":"2026033014421881300_ref044","volume-title":"Statistical estimation and testing via the sorted L1 norm","author":"Bogdan","year":"2013"},{"issue":"1","key":"2026033014421881300_ref045","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1541-0420.2007.00843.x","article-title":"Simultaneous regression shrinkage, variable selection, and supervised clustering of predictors with oscar","volume":"64","author":"Bondell","year":"2008","journal-title":"Biometrics"},{"key":"2026033014421881300_ref046","first-page":"2107","article-title":"Collaborative filtering with graph information: Consistency and scalable methods","volume-title":"Advances in Neural Information Processing Systems (NIPS 2015)","author":"Rao","year":"2015"},{"key":"2026033014421881300_ref047","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","volume-title":"Advances in Neural Information Processing Systems (NIPS 2002)","author":"Belkin","year":"2002"},{"issue":"6","key":"2026033014421881300_ref048","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Computation"},{"key":"2026033014421881300_ref049","first-page":"39","volume-title":"Harnessing sparsity over the continuum: Atomic norm minimization for superresolution","author":"Chi","year":"2020"},{"issue":"3","key":"2026033014421881300_ref050","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S0895479800371177","article-title":"Spectral factorizations and sums of squares representations via semidefinite programming","volume":"23","author":"McLean","year":"2002","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2026033014421881300_ref051","volume-title":"Positive Trigonometric Polynomials and Signal Processing Applications","author":"Dumitrescu","year":"2007"},{"key":"2026033014421881300_ref052","first-page":"388","article-title":"Gap safe screening rules for sparse-group lasso","volume-title":"Advances in Neural Information Processing Systems (NIPS 2016)","author":"Ndiaye","year":"2016"},{"issue":"3","key":"2026033014421881300_ref053","doi-asserted-by":"crossref","first-page":"2406","DOI":"10.1137\/17M1119020","article-title":"Foundations of gauge and perspective duality","volume":"28","author":"Aravkin","year":"2018","journal-title":"SIAM J. Optim."},{"key":"2026033014421881300_ref054","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1364\/JOSAA.10.001046","article-title":"Phase problem in crystallography","volume":"10","author":"Harrison","year":"1993","journal-title":"J. Opt. Soc. Am. A"},{"key":"2026033014421881300_ref055","first-page":"87","volume-title":"Phase retrieval with application to optical imaging: A contemporary overview","author":"Shechtman","year":"2015"},{"issue":"1","key":"2026033014421881300_ref056","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/110848074","article-title":"Phase retrieval via matrix completion","volume":"6","author":"Cand\u00e8s","year":"2013","journal-title":"SIAM J. Imag. Sci."},{"issue":"8","key":"2026033014421881300_ref057","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1002\/cpa.21432","article-title":"Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming","volume":"66","author":"Cand\u00e8s","year":"2013","journal-title":"Comm. Pure Appl. Math."},{"key":"2026033014421881300_ref058","doi-asserted-by":"crossref","DOI":"10.1137\/S1052623495292130","article-title":"Convergence of proximal-like algorithms","volume":"7","author":"Teboulle","year":"1997","journal-title":"SIAM J. Optim."},{"key":"2026033014421881300_ref059","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky","year":"1983"},{"issue":"3","key":"2026033014421881300_ref060","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","article-title":"Mirror descent and nonlinear projected subgradient methods for convex optimization","volume":"31","author":"Beck","year":"2003","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2026033014421881300_ref061","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","article-title":"The weighted majority algorithm","volume":"108","author":"Littlestone","year":"1994","journal-title":"Inform. and Comput."},{"issue":"771","key":"2026033014421881300_ref062","first-page":"1612","article-title":"A short introduction to boosting","volume":"14","author":"Freund","year":"1999","journal-title":"J. Jpn. Soc. Artif. Intell."},{"key":"2026033014421881300_ref063","first-page":"5798","volume-title":"Forward-backward greedy algorithms for atomic norm regularization","author":"Rao","year":"2015"},{"key":"2026033014421881300_ref064","first-page":"471","volume-title":"A simple algorithm for nuclear norm regularized problems","author":"Jaggi","year":"2010"},{"key":"2026033014421881300_ref065","volume-title":"Large-scale convex minimization with a low-rank constraint","author":"Shalev-Shwartz","year":"2011"},{"key":"2026033014421881300_ref066","first-page":"314","volume-title":"Efficient and guaranteed rank minimization by atomic decomposition","author":"Lee","year":"2009"},{"key":"2026033014421881300_ref067","first-page":"1188","volume-title":"Sketchy decisions: Convex low-rank matrix optimization with optimal storage","author":"Yurtsever","year":"2017"},{"issue":"2","key":"2026033014421881300_ref068","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/1345448.1345465","article-title":"Lessons from the Netflix prize challenge","volume":"9","author":"Bell","year":"2007","journal-title":"ACM SIGKDD Explorations Newsletter"},{"issue":"1","key":"2026033014421881300_ref069","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580219","article-title":"An extension of the Frank and Wolfe method of feasible irections","volume":"6","author":"Holloway","year":"1974","journal-title":"Math. Program."},{"issue":"12","key":"2026033014421881300_ref070","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026033014421881300_ref071","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/090772204","article-title":"A unifying polyhedral approximation framework for convex optimization","volume":"21","author":"Bertsekas","year":"2011","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2026033014421881300_ref072","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","article-title":"The cutting-plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"2026033014421881300_ref073","first-page":"264","volume-title":"Bundle methods for dual atomic pursuit","author":"Fan","year":"2019"},{"issue":"5","key":"2026033014421881300_ref074","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","article-title":"Multiplier and gradient methods","volume":"4","author":"Hestenes","year":"1969","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2026033014421881300_ref075","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","article-title":"Proximity control in bundle methods for convex nondifferentiable minimization","volume":"46","author":"Kiwiel","year":"1990","journal-title":"Math. Program."},{"key":"2026033014421881300_ref076","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume-title":"Advances in Neural Information Processing Systems (NIPS 2009)","author":"Wright","year":"2009"},{"issue":"3","key":"2026033014421881300_ref077","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","article-title":"Robust principal component analysis?","volume":"58","author":"Cand\u00e8s","year":"2011","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"2026033014421881300_ref078","first-page":"32","article-title":"Compressive principal component pursuit","volume":"2","author":"Wright","year":"2013","journal-title":"IMA Inform. Inference"},{"issue":"3","key":"2026033014421881300_ref079","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10208-014-9191-2","article-title":"Sharp recovery bounds for convex demixing, with applications","volume":"14","author":"McCoy","year":"2014","journal-title":"Found. Comput. Math."},{"issue":"3","key":"2026033014421881300_ref080","first-page":"337","article-title":"Universality laws for randomized dimension reduction, with applications","volume":"7","author":"Oymak","year":"2017","journal-title":"IMA Inform. Inference"},{"issue":"2","key":"2026033014421881300_ref081","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","article-title":"Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit","volume":"58","author":"Donoho","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026033014421881300_ref082","doi-asserted-by":"crossref","first-page":"1366","DOI":"10.1137\/18M1209088","article-title":"Polar convolution","volume":"29","author":"Friedlander","year":"2019","journal-title":"SIAM J. Optim."},{"key":"2026033014421881300_ref083","first-page":"131","article-title":"On a convolution operation obtained by adding level sets: Classical and new results","volume":"29","author":"Seeger","year":"1995","journal-title":"RAIRO Recherche Op\u00e9rationnelle"}],"container-title":["Foundations and Trends\u00ae in Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftopt\/article-pdf\/3\/4\/280\/10975897\/2400000028en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftopt\/article-pdf\/3\/4\/280\/10975897\/2400000028en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:42:31Z","timestamp":1774896151000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftopt\/article\/3\/4\/280\/1324792\/Atomic-Decomposition-via-Polar-AlignmentThe"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,24]]},"references-count":83,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11,24]]}},"URL":"https:\/\/doi.org\/10.1561\/2400000028","relation":{},"ISSN":["2167-3888","2167-3918"],"issn-type":[{"value":"2167-3888","type":"print"},{"value":"2167-3918","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,24]]}}}