{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/admm/papers/4","list_of":"/method/admm","method":"ADMM","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,398],"of":398,"counts":{"archive_papers_tagged":398,"with_a_code_link":97,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":398,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/admm","prev":"/method/admm/papers/3","next":null,"papers":[{"paper":"/paper/estimating-time-varying-graphical-models","slug":"estimating-time-varying-graphical-models","title":"Estimating Time-Varying Graphical Models","date":"2018-04-11","arxiv_id":"1804.03811","n_code_links":2,"syntology":null},{"paper":"/paper/a-systematic-dnn-weight-pruning-framework","slug":"a-systematic-dnn-weight-pruning-framework","title":"A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multipliers","date":"2018-04-10","arxiv_id":"1804.03294","n_code_links":4,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["KaiqiZhang/admm-pruning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"an-admm-based-universal-framework-for","title":"An ADMM-Based Universal Framework for Adversarial Attacks on Deep Neural Networks","date":"2018-04-09","arxiv_id":"1804.03193","n_code_links":0,"syntology":null},{"paper":"/paper/image-segmentation-using-sparse-subset","slug":"image-segmentation-using-sparse-subset","title":"Image Segmentation using Sparse Subset Selection","date":"2018-04-08","arxiv_id":"1804.02721","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-block-wise-asynchronous-and-distributed","title":"A Block-wise, Asynchronous and Distributed ADMM Algorithm for General Form Consensus Optimization","date":"2018-02-24","arxiv_id":"1802.08882","n_code_links":0,"syntology":null},{"paper":"/paper/continuous-relaxation-of-map-inference-a","slug":"continuous-relaxation-of-map-inference-a","title":"Continuous Relaxation of MAP Inference: A Nonconvex Perspective","date":"2018-02-21","arxiv_id":"1802.07796","n_code_links":2,"syntology":null},{"paper":null,"slug":"an-efficient-semismooth-newton-based","title":"An Efficient Semismooth Newton Based Algorithm for Convex Clustering","date":"2018-02-20","arxiv_id":"1802.07091","n_code_links":0,"syntology":null},{"paper":"/paper/systematic-weight-pruning-of-dnns-using","slug":"systematic-weight-pruning-of-dnns-using","title":"Systematic Weight Pruning of DNNs using Alternating Direction Method of Multipliers","date":"2018-02-15","arxiv_id":"1802.05747","n_code_links":1,"syntology":null},{"paper":null,"slug":"lsalsa-efficient-sparse-coding-in-single-and","title":"LSALSA: Accelerated Source Separation via Learned Sparse Coding","date":"2018-02-13","arxiv_id":"1802.06875","n_code_links":0,"syntology":null},{"paper":null,"slug":"mini-batch-stochastic-admms-for-nonconvex","title":"Mini-Batch Stochastic ADMMs for Nonconvex Nonsmooth Optimization","date":"2018-02-08","arxiv_id":"1802.03284","n_code_links":0,"syntology":null},{"paper":null,"slug":"scene-adapted-plug-and-play-algorithm-with","title":"Scene-Adapted Plug-and-Play Algorithm with Guaranteed Convergence: Applications to Data Fusion in Imaging","date":"2018-01-02","arxiv_id":"1801.00605","n_code_links":0,"syntology":null},{"paper":null,"slug":"nonconvex-sparse-spectral-clustering-by","title":"Nonconvex Sparse Spectral Clustering by Alternating Direction Method of Multipliers and Its Convergence Analysis","date":"2017-12-08","arxiv_id":"1712.02979","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-local-analysis-of-block-coordinate-descent","title":"A Local Analysis of Block Coordinate Descent for Gaussian Phase Retrieval","date":"2017-12-06","arxiv_id":"1712.02083","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-without-a-fixed-penalty-parameter-faster","title":"ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization","date":"2017-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-admm-algorithm-for-structural","title":"An Efficient ADMM Algorithm for Structural Break Detection in Multivariate Time Series","date":"2017-11-22","arxiv_id":"1711.08392","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-peaceman-rachford-splitting-method","title":"Scalable Peaceman-Rachford Splitting Method with Proximal Terms","date":"2017-11-14","arxiv_id":"1711.04955","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-view-x-ray-ct-reconstruction-using","title":"Sparse-View X-Ray CT Reconstruction Using $\\ell_1$ Prior with Learned Transform","date":"2017-11-02","arxiv_id":"1711.00905","n_code_links":0,"syntology":null},{"paper":null,"slug":"zeroth-order-online-alternating-direction","title":"Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications","date":"2017-10-21","arxiv_id":"1710.07804","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-memristor-based-optimization-framework-for","title":"A Memristor-Based Optimization Framework for AI Applications","date":"2017-10-18","arxiv_id":"1710.08882","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-decentralized-learning-using-admm-with","title":"Robust Decentralized Learning Using ADMM with Unreliable Agents","date":"2017-10-14","arxiv_id":"1710.05241","n_code_links":0,"syntology":null},{"paper":null,"slug":"how-is-distributed-admm-affected-by-network","title":"How is Distributed ADMM Affected by Network Topology?","date":"2017-10-02","arxiv_id":"1710.00889","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-very-large-scale-bundle","title":"Distributed Very Large Scale Bundle Adjustment by Global Camera Consensus","date":"2017-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"high-dimensional-dependency-structure","title":"High-Dimensional Dependency Structure Learning for Physical Processes","date":"2017-09-12","arxiv_id":"1709.03891","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-inner-loop-free-solution-to-inverse","title":"An inner-loop free solution to inverse problems using deep neural networks","date":"2017-09-06","arxiv_id":"1709.01841","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-solution-of-large-scale-linear","title":"Distributed Solution of Large-Scale Linear Systems via Accelerated Projection-Based Consensus","date":"2017-08-04","arxiv_id":"1708.01413","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-latent-space-models-with-angular","title":"Learning Latent Space Models with Angular Constraints","date":"2017-08-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerated-variance-reduced-stochastic-admm","title":"Accelerated Variance Reduced Stochastic ADMM","date":"2017-07-11","arxiv_id":"1707.03190","n_code_links":0,"syntology":null},{"paper":"/paper/convolutional-dictionary-learning","slug":"convolutional-dictionary-learning","title":"Convolutional Dictionary Learning: Acceleration and Convergence","date":"2017-07-03","arxiv_id":"1707.00389","n_code_links":1,"syntology":null},{"paper":null,"slug":"scalable-online-convolutional-sparse-coding","title":"Scalable Online Convolutional Sparse Coding","date":"2017-06-21","arxiv_id":"1706.06972","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-consensus-admm-for-distributed","title":"Adaptive Consensus ADMM for Distributed Optimization","date":"2017-06-09","arxiv_id":"1706.02869","n_code_links":0,"syntology":null},{"paper":null,"slug":"plug-and-play-unplugged-optimization-free","title":"Plug-and-Play Unplugged: Optimization Free Reconstruction using Consensus Equilibrium","date":"2017-05-24","arxiv_id":"1705.08983","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-net-a-deep-learning-approach-for","title":"ADMM-Net: A Deep Learning Approach for Compressive Sensing MRI","date":"2017-05-19","arxiv_id":"1705.06869","n_code_links":0,"syntology":null},{"paper":null,"slug":"discrete-continuous-admm-for-transductive","title":"Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs","date":"2017-05-14","arxiv_id":"1705.05020","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-relaxed-admm-convergence-theory-and","title":"Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation","date":"2017-04-10","arxiv_id":"1704.02712","n_code_links":0,"syntology":null},{"paper":null,"slug":"markov-chain-lifting-and-distributed-admm","title":"Markov Chain Lifting and Distributed ADMM","date":"2017-03-10","arxiv_id":"1703.03859","n_code_links":0,"syntology":null},{"paper":"/paper/easily-parallelizable-and-distributable-class","slug":"easily-parallelizable-and-distributable-class","title":"Easily parallelizable and distributable class of algorithms for structured sparsity, with optimal acceleration","date":"2017-02-21","arxiv_id":"1702.06234","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"an-efficient-decomposition-framework-for","title":"An Efficient Decomposition Framework for Discriminative Segmentation with Supermodular Losses","date":"2017-02-13","arxiv_id":"1702.03690","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-empirical-study-of-admm-for-nonconvex","title":"An Empirical Study of ADMM for Nonconvex Problems","date":"2016-12-10","arxiv_id":"1612.03349","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-admm-net-for-compressive-sensing-mri","title":"Deep ADMM-Net for Compressive Sensing MRI","date":"2016-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/the-little-engine-that-could-regularization","slug":"the-little-engine-that-could-regularization","title":"The Little Engine that Could: Regularization by Denoising (RED)","date":"2016-11-09","arxiv_id":"1611.02862","n_code_links":2,"syntology":null},{"paper":"/paper/optimization-for-large-scale-machine-learning","slug":"optimization-for-large-scale-machine-learning","title":"Optimization for Large-Scale Machine Learning with Distributed Features and Observations","date":"2016-10-31","arxiv_id":"1610.10060","n_code_links":1,"syntology":null},{"paper":"/paper/sdp-relaxation-with-randomized-rounding-for","slug":"sdp-relaxation-with-randomized-rounding-for","title":"SDP Relaxation with Randomized Rounding for Energy Disaggregation","date":"2016-10-29","arxiv_id":"1610.09491","n_code_links":2,"syntology":null},{"paper":null,"slug":"decentralized-collaborative-learning-of","title":"Decentralized Collaborative Learning of Personalized Models over Networks","date":"2016-10-17","arxiv_id":"1610.05202","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-alternating-direction-method-of","title":"Stochastic Alternating Direction Method of Multipliers with Variance Reduction for Nonconvex Optimization","date":"2016-10-10","arxiv_id":"1610.02758","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-convex-optimization-with-many","title":"Distributed Convex Optimization with Many Convex Constraints","date":"2016-10-07","arxiv_id":"1610.02967","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerated-first-order-primal-dual-proximal","title":"Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming","date":"2016-06-29","arxiv_id":"1606.09155","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-application-of-network-lasso-optimization","title":"An Application of Network Lasso Optimization For Ride Sharing Prediction","date":"2016-06-10","arxiv_id":"1606.03276","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-admm-with-spectral-penalty-parameter","title":"Adaptive ADMM with Spectral Penalty Parameter Selection","date":"2016-05-24","arxiv_id":"1605.07246","n_code_links":0,"syntology":null},{"paper":null,"slug":"randomized-primal-dual-proximal-block","title":"Randomized Primal-Dual Proximal Block Coordinate Updates","date":"2016-05-19","arxiv_id":"1605.05969","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-nonconvex-and-nonsmooth","title":"Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis","date":"2016-05-09","arxiv_id":"1605.02408","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-stochastic-optimization-for-deep","title":"Distributed stochastic optimization for deep learning (thesis)","date":"2016-05-07","arxiv_id":"1605.02216","n_code_links":0,"syntology":null},{"paper":null,"slug":"plug-and-play-admm-for-image-restoration","title":"Plug-and-Play ADMM for Image Restoration: Fixed Point Convergence and Applications","date":"2016-05-05","arxiv_id":"1605.01710","n_code_links":0,"syntology":null},{"paper":null,"slug":"ell_p-box-admm-a-versatile-framework-for","title":"$\\ell_p$-Box ADMM: A Versatile Framework for Integer Programming","date":"2016-04-26","arxiv_id":"1604.07666","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-variance-reduced-admm","title":"Stochastic Variance-Reduced ADMM","date":"2016-04-24","arxiv_id":"1604.07070","n_code_links":0,"syntology":null},{"paper":null,"slug":"patient-flow-prediction-via-discriminative","title":"Patient Flow Prediction via Discriminative Learning of Mutually-Correcting Processes","date":"2016-02-14","arxiv_id":"1602.05112","n_code_links":0,"syntology":null},{"paper":null,"slug":"image-restoration-and-reconstruction-using","title":"Image Restoration and Reconstruction using Variable Splitting and Class-adapted Image Priors","date":"2016-02-12","arxiv_id":"1602.04052","n_code_links":0,"syntology":null},{"paper":"/paper/a-framework-for-fast-image-deconvolution-with","slug":"a-framework-for-fast-image-deconvolution-with","title":"A Framework for Fast Image Deconvolution with Incomplete Observations","date":"2016-02-03","arxiv_id":"1602.01410","n_code_links":1,"syntology":null},{"paper":null,"slug":"algorithm-induced-prior-for-image-restoration","title":"Algorithm-Induced Prior for Image Restoration","date":"2016-02-01","arxiv_id":"1602.00715","n_code_links":0,"syntology":null},{"paper":null,"slug":"practical-algorithms-for-learning-near","title":"Practical Algorithms for Learning Near-Isometric Linear Embeddings","date":"2016-01-01","arxiv_id":"1601.00062","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-explicit-rate-bound-for-the-over-relaxed","title":"An Explicit Rate Bound for the Over-Relaxed ADMM","date":"2015-12-07","arxiv_id":"1512.02063","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-primal-dual-splitting-methods-for","title":"Adaptive Primal-Dual Splitting Methods for Statistical Learning and Image Processing","date":"2015-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"alternating-direction-method-of-multipliers","title":"Alternating direction method of multipliers for regularized multiclass support vector machines","date":"2015-11-30","arxiv_id":"1511.09153","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-saddle-point-algorithm-for-generalized","title":"Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with the Ordered l1-Norm","date":"2015-11-18","arxiv_id":"1511.05864","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-proximal-linearized-alternating","title":"Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting","date":"2015-11-14","arxiv_id":"1511.05133","n_code_links":0,"syntology":null},{"paper":null,"slug":"facial-expression-recognition-using-sparse","title":"Facial Expression Recognition Using Sparse Gaussian Conditional Random Field","date":"2015-11-06","arxiv_id":"1511.02023","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-weighted-parameter-averaging-for","title":"Distributed Weighted Parameter Averaging for SVM Training on Big Data","date":"2015-09-30","arxiv_id":"1509.09030","n_code_links":0,"syntology":null},{"paper":"/paper/fast-discrete-distribution-clustering-using","slug":"fast-discrete-distribution-clustering-using","title":"Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support","date":"2015-09-30","arxiv_id":"1510.00012","n_code_links":2,"syntology":null},{"paper":null,"slug":"asynchronous-distributed-admm-for-large-scale","title":"Asynchronous Distributed ADMM for Large-Scale Optimization- Part II: Linear Convergence Analysis and Numerical Performance","date":"2015-09-09","arxiv_id":"1509.02604","n_code_links":0,"syntology":null},{"paper":null,"slug":"asynchronous-distributed-admm-for-large-scale-1","title":"Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis","date":"2015-09-09","arxiv_id":"1509.02597","n_code_links":0,"syntology":null},{"paper":null,"slug":"decentralized-joint-sparse-signal-recovery-a","title":"Decentralized Joint-Sparse Signal Recovery: A Sparse Bayesian Learning Approach","date":"2015-07-09","arxiv_id":"1507.02387","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-flexible-and-efficient-algorithmic","title":"A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization","date":"2015-06-13","arxiv_id":"1506.04209","n_code_links":0,"syntology":null},{"paper":null,"slug":"global-convergence-of-unmodified-3-block-admm","title":"Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems","date":"2015-05-16","arxiv_id":"1505.04252","n_code_links":0,"syntology":null},{"paper":null,"slug":"convex-denoising-using-non-convex-tight-frame","title":"Convex Denoising using Non-Convex Tight Frame Regularization","date":"2015-04-04","arxiv_id":"1504.00976","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-scale-free-networks-by-dynamic-node","title":"Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior","date":"2015-03-07","arxiv_id":"1503.02129","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-stochastic-alternating-direction","title":"Scalable Stochastic Alternating Direction Method of Multipliers","date":"2015-02-12","arxiv_id":"1502.03529","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-admm-algorithm-for-the-euclidean-median","title":"A new ADMM algorithm for the Euclidean median and its application to robust patch regression","date":"2015-01-16","arxiv_id":"1501.03879","n_code_links":0,"syntology":null},{"paper":"/paper/deep-learning-with-elastic-averaging-sgd","slug":"deep-learning-with-elastic-averaging-sgd","title":"Deep learning with Elastic Averaging SGD","date":"2014-12-20","arxiv_id":"1412.6651","n_code_links":10,"syntology":{"ran":1,"of":12,"n_ran_checked":1,"n_instrument":0,"unverified":11,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","official":{"repos":["sixin-zh/mpiT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"multi-step-stochastic-admm-in-high-dimensions-1","title":"Multi-Step Stochastic ADMM in High Dimensions: Applications to Sparse Optimization and Matrix Decomposition","date":"2014-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"parallel-direction-method-of-multipliers","title":"Parallel Direction Method of Multipliers","date":"2014-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"trend-filtering-on-graphs","title":"Trend Filtering on Graphs","date":"2014-10-28","arxiv_id":"1410.7690","n_code_links":0,"syntology":null},{"paper":null,"slug":"dissimilarity-based-sparse-subset-selection","title":"Dissimilarity-based Sparse Subset Selection","date":"2014-07-25","arxiv_id":"1407.6810","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-scale-supervised-hierarchical-feature","title":"Large-scale Supervised Hierarchical Feature Learning for Face Recognition","date":"2014-07-06","arxiv_id":"1407.1490","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalized-dantzig-selector-application-to","title":"Generalized Dantzig Selector: Application to the k-support norm","date":"2014-06-20","arxiv_id":"1406.5291","n_code_links":0,"syntology":null},{"paper":"/paper/fast-and-flexible-admm-algorithms-for-trend","slug":"fast-and-flexible-admm-algorithms-for-trend","title":"Fast and Flexible ADMM Algorithms for Trend Filtering","date":"2014-06-09","arxiv_id":"1406.2082","n_code_links":4,"syntology":null},{"paper":null,"slug":"roml-a-robust-feature-correspondence-approach","title":"ROML: A Robust Feature Correspondence Approach for Matching Objects in A Set of Images","date":"2014-03-31","arxiv_id":"1403.7877","n_code_links":0,"syntology":null},{"paper":"/paper/multi-step-stochastic-admm-in-high-dimensions","slug":"multi-step-stochastic-admm-in-high-dimensions","title":"Multi-Step Stochastic ADMM in High Dimensions: Applications to Sparse Optimization and Noisy Matrix Decomposition","date":"2014-02-20","arxiv_id":"1402.5131","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-convergence-proof-of-the-split-bregman","title":"A convergence proof of the split Bregman method for regularized least-squares problems","date":"2014-02-18","arxiv_id":"1402.4371","n_code_links":0,"syntology":null},{"paper":null,"slug":"mrfalign-protein-homology-detection-through","title":"MRFalign: Protein Homology Detection through Alignment of Markov Random Fields","date":"2014-01-12","arxiv_id":"1401.2668","n_code_links":0,"syntology":null},{"paper":"/paper/communication-efficient-distributed-1","slug":"communication-efficient-distributed-1","title":"Communication Efficient Distributed Optimization using an Approximate Newton-type Method","date":"2013-12-30","arxiv_id":"1312.7853","n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptive-stochastic-alternating-direction","title":"Adaptive Stochastic Alternating Direction Method of Multipliers","date":"2013-12-16","arxiv_id":"1312.4564","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-algorithm-for-graphical-lasso-with-an","title":"ADMM Algorithm for Graphical Lasso with an $\\ell_{\\infty}$ Element-wise Norm Constraint","date":"2013-11-28","arxiv_id":"1311.7198","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-dual-coordinate-ascent-with-1","title":"Stochastic Dual Coordinate Ascent with Alternating Direction Multiplier Method","date":"2013-11-04","arxiv_id":"1311.0622","n_code_links":0,"syntology":null},{"paper":null,"slug":"bethe-admm-for-tree-decomposition-based","title":"Bethe-ADMM for Tree Decomposition based Parallel MAP Inference","date":"2013-09-26","arxiv_id":"1309.6829","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-hypergraph-partitioned-vertex-programming","title":"A Hypergraph-Partitioned Vertex Programming Approach for Large-scale Consensus Optimization","date":"2013-08-30","arxiv_id":"1308.6823","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-stochastic-alternating-direction-method","title":"Fast Stochastic Alternating Direction Method of Multipliers","date":"2013-08-16","arxiv_id":"1308.3558","n_code_links":0,"syntology":null},{"paper":null,"slug":"bregman-alternating-direction-method-of","title":"Bregman Alternating Direction Method of Multipliers","date":"2013-06-13","arxiv_id":"1306.3203","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-improved-three-weight-message-passing","title":"An Improved Three-Weight Message-Passing Algorithm","date":"2013-05-08","arxiv_id":"1305.1961","n_code_links":0,"syntology":null},{"paper":"/paper/splitting-methods-for-convex-clustering","slug":"splitting-methods-for-convex-clustering","title":"Splitting Methods for Convex Clustering","date":"2013-04-01","arxiv_id":"1304.0499","n_code_links":1,"syntology":null}],"record_sha256":"28223fdb2704586d85cca1dd76be3d047bdedd4253a199e9bd8252c75eeffb79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}