{"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","slug":"admm","name":"ADMM","full_name":"Alternating Direction Method of Multipliers","full_name_withheld":false,"description_markdown":"The **alternating direction method of multipliers** (**ADMM**) is an algorithm that solves convex optimization problems by breaking them into smaller pieces, each of which are then easier to handle. It takes the form of a decomposition-coordination procedure, in which the solutions to small\r\nlocal subproblems are coordinated to find a solution to a large global problem. ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. It turns out to be equivalent or closely related to many other algorithms\r\nas well, such as Douglas-Rachford splitting from numerical analysis, Spingarn’s method of partial inverses, Dykstra’s alternating projections method, Bregman iterative algorithms for l1 problems in signal processing, proximal methods, and many others.\r\n\r\nText Source: [https://stanford.edu/~boyd/papers/pdf/admm_distr_stats.pdf](https://stanford.edu/~boyd/papers/pdf/admm_distr_stats.pdf)\r\n\r\nImage Source: [here](https://www.slideshare.net/derekcypang/alternating-direction)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":398,"archive_num_papers":398,"papers_newest_first":[{"paper":"/paper/federated-admm-from-bayesian-duality","slug":"federated-admm-from-bayesian-duality","title":"Federated ADMM from Bayesian Duality","date":"2025-06-16","arxiv_id":"2506.13150","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["team-approx-bayes/bayes-admm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"efficient-learning-of-balanced-signed-graphs-1","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","date":"2025-06-02","arxiv_id":"2506.01826","n_code_links":0,"syntology":null},{"paper":"/paper/proximal-algorithm-unrolling-flexible-and","slug":"proximal-algorithm-unrolling-flexible-and","title":"Proximal Algorithm Unrolling: Flexible and Efficient Reconstruction Networks for Single-Pixel Imaging","date":"2025-05-29","arxiv_id":"2505.23180","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":5,"n_instrument":1,"unverified":3,"pointer_only":0,"phrase":"6 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["pwangcs/proxunroll"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/linear-convergence-of-plug-and-play","slug":"linear-convergence-of-plug-and-play","title":"Linear Convergence of Plug-and-Play Algorithms with Kernel Denoisers","date":"2025-05-21","arxiv_id":"2505.15318","n_code_links":1,"syntology":null},{"paper":null,"slug":"optimization-problem-solving-can-transition","title":"Optimization Problem Solving Can Transition to Evolutionary Agentic Workflows","date":"2025-05-07","arxiv_id":"2505.04354","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-variable-selection-in-large-scale","title":"Enhancing Variable Selection in Large-scale Logistic Regression: Leveraging Manual Labeling with Beneficial Noise","date":"2025-04-23","arxiv_id":"2504.16585","n_code_links":0,"syntology":null},{"paper":null,"slug":"residual-evasive-attacks-on-admm-in","title":"Residual-Evasive Attacks on ADMM in Distributed Optimization","date":"2025-04-22","arxiv_id":"2504.18570","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-complexity-sdp-admm-for-physical-layer","title":"Low-Complexity SDP-ADMM for Physical-Layer Multicasting in Massive MIMO Systems","date":"2025-04-08","arxiv_id":"2504.06090","n_code_links":0,"syntology":null},{"paper":null,"slug":"plug-and-play-distributed-control-of","title":"Plug and Play Distributed Control of Clustered Energy Hub Networks","date":"2025-04-08","arxiv_id":"2504.06179","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-mixed-integer-quadratic","title":"Distributed Mixed-Integer Quadratic Programming for Mixed-Traffic Intersection Control","date":"2025-04-06","arxiv_id":"2504.04618","n_code_links":0,"syntology":null},{"paper":"/paper/sparsity-promoting-reachability-analysis-and","slug":"sparsity-promoting-reachability-analysis-and","title":"Sparsity-Promoting Reachability Analysis and Optimization of Constrained Zonotopes","date":"2025-04-04","arxiv_id":"2504.03885","n_code_links":1,"syntology":null},{"paper":null,"slug":"modular-distributed-nonconvex-learning-with","title":"Modular Distributed Nonconvex Learning with Error Feedback","date":"2025-03-18","arxiv_id":"2503.14055","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-smoothing-admm-for-localization","title":"Federated Smoothing ADMM for Localization","date":"2025-03-12","arxiv_id":"2503.09497","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-distributed-learning-over","title":"Efficient Distributed Learning over Decentralized Networks with Convoluted Support Vector Machine","date":"2025-03-10","arxiv_id":"2503.07563","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-adaptive-multiparameter-penalty-selection","title":"An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM","date":"2025-02-28","arxiv_id":"2502.21202","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-primal-dual-algorithms","title":"Distributed Primal-Dual Algorithms: Unification, Connections, and Insights","date":"2025-02-01","arxiv_id":"2502.00470","n_code_links":0,"syntology":null},{"paper":null,"slug":"connecting-federated-admm-to-bayes","title":"Connecting Federated ADMM to Bayes","date":"2025-01-28","arxiv_id":"2501.17325","n_code_links":0,"syntology":null},{"paper":null,"slug":"three-dimensional-diffusion-weighted-multi","title":"Three-Dimensional Diffusion-Weighted Multi-Slab MRI With Slice Profile Compensation Using Deep Energy Model","date":"2025-01-28","arxiv_id":"2501.17152","n_code_links":0,"syntology":null},{"paper":null,"slug":"asynchronous-distributed-collision-avoidance","title":"Asynchronous distributed collision avoidance with intention consensus for inland autonomous ships","date":"2025-01-27","arxiv_id":"2501.15899","n_code_links":0,"syntology":null},{"paper":"/paper/radio-map-estimation-via-latent-domain-plug","slug":"radio-map-estimation-via-latent-domain-plug","title":"Radio Map Estimation via Latent Domain Plug-and-Play Denoising","date":"2025-01-23","arxiv_id":"2501.13472","n_code_links":1,"syntology":null},{"paper":"/paper/a-plug-and-play-bregman-admm-module-for","slug":"a-plug-and-play-bregman-admm-module-for","title":"A Plug-and-Play Bregman ADMM Module for Inferring Event Branches in Temporal Point Processes","date":"2025-01-08","arxiv_id":"2501.04529","n_code_links":1,"syntology":null},{"paper":null,"slug":"constrained-and-regularized-quantitative","title":"Constrained and Regularized Quantitative Ultrasound Parameter Estimation using ADMM","date":"2025-01-07","arxiv_id":"2501.04109","n_code_links":0,"syntology":null},{"paper":null,"slug":"slog-net-algorithm-unrolling-for-source","title":"SLoG-Net: Algorithm Unrolling for Source Localization on Graphs","date":"2024-12-31","arxiv_id":"2501.00442","n_code_links":0,"syntology":null},{"paper":null,"slug":"iterative-reweighted-framework-based","title":"Iterative Reweighted Framework Based Algorithms for Sparse Linear Regression with Generalized Elastic Net Penalty","date":"2024-11-22","arxiv_id":"2411.14875","n_code_links":0,"syntology":null},{"paper":null,"slug":"decoupling-training-free-guided-diffusion-by","title":"Decoupling Training-Free Guided Diffusion by ADMM","date":"2024-11-18","arxiv_id":"2411.12773","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-for-structured-fractional-minimization","title":"ADMM for Structured Fractional Minimization","date":"2024-11-12","arxiv_id":"2411.07496","n_code_links":0,"syntology":null},{"paper":"/paper/online-parallel-multi-task-relationship","slug":"online-parallel-multi-task-relationship","title":"Online Parallel Multi-Task Relationship Learning via Alternating Direction Method of Multipliers","date":"2024-11-09","arxiv_id":"2411.06135","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-multi-contrast-cardiac-mri","title":"Deep Multi-contrast Cardiac MRI Reconstruction via vSHARP with Auxiliary Refinement Network","date":"2024-11-02","arxiv_id":"2411.01291","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-admm-approach-for-the-power","title":"Distributed ADMM Approach for the Power Distribution Network Reconfiguration","date":"2024-10-06","arxiv_id":"2410.04604","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-analysis-of-market-to-market-coordination","title":"An Analysis of Market-to-Market Coordination","date":"2024-10-02","arxiv_id":"2410.01986","n_code_links":0,"syntology":null},{"paper":null,"slug":"hierarchical-federated-admm","title":"Hierarchical Federated ADMM","date":"2024-09-27","arxiv_id":"2409.18796","n_code_links":0,"syntology":null},{"paper":"/paper/two-sparse-matrices-are-better-than-one","slug":"two-sparse-matrices-are-better-than-one","title":"Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization","date":"2024-09-27","arxiv_id":"2409.18850","n_code_links":1,"syntology":{"ran":6,"of":12,"n_ran_checked":3,"n_instrument":3,"unverified":6,"pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","official":{"repos":["usamec/double_sparse"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"accelerating-multi-block-constrained","title":"Accelerating Multi-Block Constrained Optimization Through Learning to Optimize","date":"2024-09-25","arxiv_id":"2409.17320","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-for-downlink-beamforming-in-cell-free","title":"ADMM for Downlink Beamforming in Cell-Free Massive MIMO Systems","date":"2024-09-09","arxiv_id":"2409.06106","n_code_links":0,"syntology":null},{"paper":null,"slug":"stability-of-primal-dual-gradient-flow","title":"Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems","date":"2024-08-28","arxiv_id":"2408.15969","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-multiview-synergy-robust-learning","title":"Enhancing Multiview Synergy: Robust Learning by Exploiting the Wave Loss Function with Consensus and Complementarity Principles","date":"2024-08-13","arxiv_id":"2408.06819","n_code_links":0,"syntology":null},{"paper":null,"slug":"2408-01307","title":"Decentralized Smoothing ADMM for Quantile Regression with Non-Convex Sparse Penalties","date":"2024-08-02","arxiv_id":"2408.01307","n_code_links":0,"syntology":null},{"paper":null,"slug":"practical-marketplace-optimization-at-uber","title":"Practical Marketplace Optimization at Uber Using Causally-Informed Machine Learning","date":"2024-07-26","arxiv_id":"2407.19078","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-based-semi-structured-pattern-pruning","title":"ADMM Based Semi-Structured Pattern Pruning Framework For Transformer","date":"2024-07-11","arxiv_id":"2407.08334","n_code_links":0,"syntology":null},{"paper":null,"slug":"unrolling-plug-and-play-gradient-graph","title":"Unrolling Plug-and-Play Gradient Graph Laplacian Regularizer for Image Restoration","date":"2024-07-01","arxiv_id":"2407.01469","n_code_links":0,"syntology":null},{"paper":null,"slug":"badm-batch-admm-for-deep-learning","title":"BADM: Batch ADMM for Deep Learning","date":"2024-06-30","arxiv_id":"2407.01640","n_code_links":0,"syntology":null},{"paper":null,"slug":"compressed-sensor-caching-and-collaborative","title":"Compressed Sensor Caching and Collaborative Sparse Data Recovery with Anchor Alignment","date":"2024-06-14","arxiv_id":"2406.10137","n_code_links":0,"syntology":null},{"paper":null,"slug":"regularized-projection-matrix-approximation","title":"Regularized Projection Matrix Approximation with Applications to Community Detection","date":"2024-05-26","arxiv_id":"2405.16598","n_code_links":0,"syntology":null},{"paper":null,"slug":"estimation-network-design-framework-for","title":"Estimation Network Design framework for efficient distributed optimization","date":"2024-04-23","arxiv_id":"2404.15273","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-general-continuous-time-formulation-of","title":"A General Continuous-Time Formulation of Stochastic ADMM and Its Variants","date":"2024-04-22","arxiv_id":"2404.14358","n_code_links":0,"syntology":null},{"paper":"/paper/trainable-joint-channel-estimation-detection","slug":"trainable-joint-channel-estimation-detection","title":"Trainable Joint Channel Estimation, Detection and Decoding for MIMO URLLC Systems","date":"2024-04-11","arxiv_id":"2404.07721","n_code_links":1,"syntology":null},{"paper":"/paper/unfolding-admm-for-enhanced-subspace","slug":"unfolding-admm-for-enhanced-subspace","title":"Unfolding ADMM for Enhanced Subspace Clustering of Hyperspectral Images","date":"2024-04-10","arxiv_id":"2404.07112","n_code_links":1,"syntology":null},{"paper":null,"slug":"decentralizing-coherent-joint-transmission-1","title":"Decentralizing Coherent Joint Transmission Precoding via Fast ADMM with Deterministic Equivalents","date":"2024-03-28","arxiv_id":"2403.19127","n_code_links":0,"syntology":null},{"paper":"/paper/graph-image-prior-for-unsupervised-dynamic","slug":"graph-image-prior-for-unsupervised-dynamic","title":"Graph Image Prior for Unsupervised Dynamic Cardiac Cine MRI Reconstruction","date":"2024-03-23","arxiv_id":"2403.15770","n_code_links":1,"syntology":null},{"paper":"/paper/tablepuppet-a-generic-framework-for","slug":"tablepuppet-a-generic-framework-for","title":"TablePuppet: A Generic Framework for Relational Federated Learning","date":"2024-03-23","arxiv_id":"2403.15839","n_code_links":1,"syntology":null},{"paper":null,"slug":"network-aware-value-stacking-of-community","title":"Network-Aware Value Stacking of Community Battery via Asynchronous Distributed Optimization","date":"2024-03-20","arxiv_id":"2403.13255","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedadmm-insa-an-inexact-and-self-adaptive","title":"FedADMM-InSa: An Inexact and Self-Adaptive ADMM for Federated Learning","date":"2024-02-21","arxiv_id":"2402.13989","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-algorithm-for-spatial-spectral","title":"An Efficient Algorithm for Spatial-Spectral Partial Volume Compartment Mapping with Applications to Multicomponent Diffusion and Relaxation MRI","date":"2024-01-23","arxiv_id":"2401.12890","n_code_links":0,"syntology":null},{"paper":null,"slug":"qcqp-net-reliably-learning-feasible","title":"QCQP-Net: Reliably Learning Feasible Alternating Current Optimal Power Flow Solutions Under Constraints","date":"2024-01-11","arxiv_id":"2401.06820","n_code_links":0,"syntology":null},{"paper":null,"slug":"aa-dladmm-an-accelerated-admm-based-framework","title":"AA-DLADMM: An Accelerated ADMM-based Framework for Training Deep Neural Networks","date":"2024-01-08","arxiv_id":"2401.03619","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-admm-and-over-relaxed-admm","title":"Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems","date":"2024-01-01","arxiv_id":"2401.00657","n_code_links":0,"syntology":null},{"paper":"/paper/privacy-amplification-by-iteration-for-admm","slug":"privacy-amplification-by-iteration-for-admm","title":"Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions","date":"2023-12-14","arxiv_id":"2312.08685","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-distributed-admm-based-deep-learning","title":"A Distributed ADMM-based Deep Learning Approach for Thermal Control in Multi-Zone Buildings under Demand Response Events","date":"2023-12-08","arxiv_id":"2312.05073","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-operating-envelopes-embedded-peer-to","title":"Dynamic Operating Envelopes Embedded Peer-to-Peer-to-Grid Energy Trading","date":"2023-11-23","arxiv_id":"2311.13832","n_code_links":0,"syntology":null},{"paper":"/paper/a-unified-consensus-based-parallel-admm","slug":"a-unified-consensus-based-parallel-admm","title":"A unified consensus-based parallel ADMM algorithm for high-dimensional regression with combined regularizations","date":"2023-11-21","arxiv_id":"2311.12319","n_code_links":1,"syntology":null},{"paper":null,"slug":"personalized-federated-learning-via-admm-with","title":"Personalized Federated Learning via ADMM with Moreau Envelope","date":"2023-11-12","arxiv_id":"2311.06756","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-training-algorithms-for-residual","title":"ADMM Algorithms for Residual Network Training: Convergence Analysis and Parallel Implementation","date":"2023-10-23","arxiv_id":"2310.15334","n_code_links":0,"syntology":null},{"paper":null,"slug":"detecting-shared-data-manipulation-in","title":"Detecting Shared Data Manipulation in Distributed Optimization Algorithms","date":"2023-10-20","arxiv_id":"2310.13252","n_code_links":0,"syntology":null},{"paper":null,"slug":"hierarchical-mtc-user-activity-detection-and","title":"Hierarchical MTC User Activity Detection and Channel Estimation with Unknown Spatial Covariance","date":"2023-10-16","arxiv_id":"2310.10204","n_code_links":0,"syntology":null},{"paper":null,"slug":"two-stage-robust-nash-bargaining-based","title":"Two stage Robust Nash Bargaining based Energy Trading between Hydrogen-enriched Gas and Active Distribution Networks","date":"2023-10-09","arxiv_id":"2310.05999","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergent-admm-plug-and-play-pet-image","title":"Convergent ADMM Plug and Play PET Image Reconstruction","date":"2023-10-06","arxiv_id":"2310.04299","n_code_links":0,"syntology":null},{"paper":null,"slug":"decentralized-micro-water-energy-co","title":"Decentralized Micro Water-Energy Co-Optimization for Small Communities","date":"2023-10-02","arxiv_id":"2310.01681","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-distributed-market","title":"Privacy-Preserving Distributed Market Mechanism for Active Distribution Networks","date":"2023-09-30","arxiv_id":"2310.00387","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-contractivity-of-plug-and-play","slug":"on-the-contractivity-of-plug-and-play","title":"On the Contractivity of Plug-and-Play Operators","date":"2023-09-28","arxiv_id":"2309.16899","n_code_links":1,"syntology":null},{"paper":"/paper/vsharp-variable-splitting-half-quadratic-admm","slug":"vsharp-variable-splitting-half-quadratic-admm","title":"vSHARP: variable Splitting Half-quadratic Admm algorithm for Reconstruction of inverse-Problems","date":"2023-09-18","arxiv_id":"2309.09954","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["nki-ai/direct"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/p-rocket-pruning-random-convolution-kernels","slug":"p-rocket-pruning-random-convolution-kernels","title":"POCKET: Pruning Random Convolution Kernels for Time Series Classification from a Feature Selection Perspective","date":"2023-09-15","arxiv_id":"2309.08499","n_code_links":2,"syntology":null},{"paper":null,"slug":"optimization-guarantees-of-unfolded-ista-and","title":"Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding","date":"2023-09-12","arxiv_id":"2309.06195","n_code_links":0,"syntology":null},{"paper":null,"slug":"smoothing-admm-for-sparse-penalized-quantile","title":"Smoothing ADMM for Sparse-Penalized Quantile Regression with Non-Convex Penalties","date":"2023-09-04","arxiv_id":"2309.03094","n_code_links":0,"syntology":null},{"paper":null,"slug":"moreau-envelope-admm-for-decentralized-weakly","title":"Moreau Envelope ADMM for Decentralized Weakly Convex Optimization","date":"2023-08-31","arxiv_id":"2308.16752","n_code_links":0,"syntology":null},{"paper":null,"slug":"temporal-spatial-model-via-trend-filtering","title":"Temporal-spatial model via Trend Filtering","date":"2023-08-30","arxiv_id":"2308.16172","n_code_links":0,"syntology":null},{"paper":null,"slug":"mkl-l-0-1-svm-1","title":"MKL-$L_{0/1}$-SVM","date":"2023-08-23","arxiv_id":"2308.12016","n_code_links":0,"syntology":null},{"paper":"/paper/scqpth-an-efficient-differentiable-splitting","slug":"scqpth-an-efficient-differentiable-splitting","title":"SCQPTH: an efficient differentiable splitting method for convex quadratic programming","date":"2023-08-16","arxiv_id":"2308.08232","n_code_links":2,"syntology":{"ran":3,"of":5,"n_ran_checked":2,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ipo-lab/scqpth","ipo-lab/scqpth_bench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"estimation-of-complex-valued-laplacian","title":"Estimation of Complex Valued Laplacian Matrices for Topology Identification in Power Systems","date":"2023-08-07","arxiv_id":"2308.03392","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-mimo-detection-with-imperfect-csi-a","title":"Robust MIMO Detection With Imperfect CSI: A Neural Network Solution","date":"2023-07-24","arxiv_id":"2307.12575","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-radar-imaging-based-on","title":"Distributed Radar Imaging Based on Accelerated ADMM","date":"2023-07-17","arxiv_id":"2307.08606","n_code_links":0,"syntology":null},{"paper":null,"slug":"multichannel-frequency-estimation-in","title":"Multichannel Frequency Estimation in Challenging Scenarios via Structured Matrix Embedding and Recovery (StruMER)","date":"2023-07-15","arxiv_id":"2307.07802","n_code_links":0,"syntology":null},{"paper":null,"slug":"kernel-support-vector-machine-classifiers","title":"Kernel Support Vector Machine Classifiers with the $\\ell_0$-Norm Hinge Loss","date":"2023-06-24","arxiv_id":"2306.13991","n_code_links":0,"syntology":null},{"paper":null,"slug":"zero-concentrated-private-distributed","title":"Private Networked Federated Learning for Nonsmooth Objectives","date":"2023-06-24","arxiv_id":"2306.14012","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-time-of-arrival-localization-via-admm","title":"Robust time-of-arrival localization via ADMM","date":"2023-06-15","arxiv_id":"2306.08819","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-equivalent-circuit-approach-to-distributed","title":"An Equivalent Circuit Approach to Distributed Optimization","date":"2023-05-24","arxiv_id":"2305.14607","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-and-estimation-error-bounds","title":"Generalization and Estimation Error Bounds for Model-based Neural Networks","date":"2023-04-19","arxiv_id":"2304.09802","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-code-deep-image-prior-based-plug-and","title":"MCDIP-ADMM: Overcoming Overfitting in DIP-based CT reconstruction","date":"2023-04-08","arxiv_id":"2304.03895","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-decentralized-energy","title":"Privacy-Preserving Decentralized Energy Management for Networked Microgrids via Objective-Based ADMM","date":"2023-04-07","arxiv_id":"2304.03649","n_code_links":0,"syntology":null},{"paper":"/paper/red-psm-regularization-by-denoising-of","slug":"red-psm-regularization-by-denoising-of","title":"RED-PSM: Regularization by Denoising of Factorized Low Rank Models for Dynamic Imaging","date":"2023-04-07","arxiv_id":"2304.03483","n_code_links":1,"syntology":null},{"paper":null,"slug":"scenario-game-admm-a-parallelized-scenario","title":"Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games","date":"2023-04-04","arxiv_id":"2304.01945","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-admm-approach-for-multi-response","title":"An ADMM approach for multi-response regression with overlapping groups and interaction effects","date":"2023-03-20","arxiv_id":"2303.11155","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-least-square-solution-method-to","title":"Distributed least square solution method to linear algebraic equations over multiagent networks","date":"2023-03-14","arxiv_id":"2303.07884","n_code_links":0,"syntology":null},{"paper":"/paper/provably-convergent-plug-and-play-quasi","slug":"provably-convergent-plug-and-play-quasi","title":"Provably Convergent Plug-and-Play Quasi-Newton Methods","date":"2023-03-09","arxiv_id":"2303.07271","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hyt35/prox-qn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"mkl-l-0-1-svm","title":"An ADMM Solver for the MKL-$L_{0/1}$-SVM","date":"2023-03-08","arxiv_id":"2303.04445","n_code_links":0,"syntology":null},{"paper":"/paper/from-noisy-fixed-point-iterations-to-private","slug":"from-noisy-fixed-point-iterations-to-private","title":"From Noisy Fixed-Point Iterations to Private ADMM for Centralized and Federated Learning","date":"2023-02-24","arxiv_id":"2302.12559","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["totilas/padadmm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"fast-direct-localization-for-millimeter-wave","title":"Fast Direct Localization for Millimeter Wave MIMO Systems via Deep ADMM Unfolding","date":"2023-02-06","arxiv_id":"2302.02557","n_code_links":0,"syntology":null},{"paper":"/paper/guaranteed-tensor-recovery-fused-low-rankness","slug":"guaranteed-tensor-recovery-fused-low-rankness","title":"Guaranteed Tensor Recovery Fused Low-rankness and Smoothness","date":"2023-02-04","arxiv_id":"2302.02155","n_code_links":1,"syntology":null},{"paper":null,"slug":"parsimonious-system-identification-from","title":"Parsimonious System Identification from Fragmented Quantized Measurements","date":"2023-01-28","arxiv_id":"2301.12043","n_code_links":0,"syntology":null},{"paper":null,"slug":"lp-quasi-norm-minimization-algorithm-and","title":"Lp Quasi-norm Minimization: Algorithm and Applications","date":"2023-01-27","arxiv_id":"2301.12027","n_code_links":0,"syntology":null},{"paper":"/paper/a-simple-adaptive-unfolding-network-for","slug":"a-simple-adaptive-unfolding-network-for","title":"A Simple Adaptive Unfolding Network for Hyperspectral Image Reconstruction","date":"2023-01-24","arxiv_id":"2301.10208","n_code_links":1,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_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"},"papers_where_code_ran":15,"papers_where_code_ran_first_page":"/method/admm/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":4,"url":"/method/admm/papers/2","json":"/method/admm/papers/2.json","rows":100},{"order":"archive","page":3,"of":4,"url":"/method/admm/papers/3","json":"/method/admm/papers/3.json","rows":100},{"order":"archive","page":4,"of":4,"url":"/method/admm/papers/4","json":"/method/admm/papers/4.json","rows":98},{"order":"ran","page":1,"of":1,"url":"/method/admm/papers/ran/1","json":"/method/admm/papers/ran/1.json","rows":15}],"tasks":[{"task":"/task/denoising","name":"Denoising","papers":30},{"task":"/task/distributed-optimization","name":"Distributed Optimization","papers":24},{"task":"/task/clustering","name":"Clustering","papers":18},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":15},{"task":"/task/federated-learning","name":"Federated Learning","papers":15},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":15},{"task":"/task/quantization","name":"Quantization","papers":15},{"task":"/task/image-restoration","name":"Image Restoration","papers":14},{"task":"/task/image-denoising","name":"Image Denoising","papers":13},{"task":"/task/regression-1","name":"regression","papers":13},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":11},{"task":"/task/deep-learning","name":"Deep Learning","papers":11},{"task":"/task/model-compression","name":"Model Compression","papers":10},{"task":"/task/super-resolution","name":"Super-Resolution","papers":10},{"task":"/task/compressed-sensing","name":"compressed sensing","papers":10},{"task":"/task/deblurring","name":"Deblurring","papers":9},{"task":"/task/image-classification","name":"Image Classification","papers":9},{"task":"/task/privacy-preserving","name":"Privacy Preserving","papers":9},{"task":"/task/segmentation","name":"Segmentation","papers":8},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":8}],"tasks_shown":20,"n_tasks":180,"usage_by_year":[{"year":"2013","papers":10},{"year":"2014","papers":12},{"year":"2015","papers":17},{"year":"2016","papers":22},{"year":"2017","papers":26},{"year":"2018","papers":28},{"year":"2019","papers":59},{"year":"2020","papers":43},{"year":"2021","papers":38},{"year":"2022","papers":41},{"year":"2023","papers":46},{"year":"2024","papers":34},{"year":"2025","papers":22}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/admm"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=ADMM","read_at":"2026-10-05T00:51:39+00:00","query":"ADMM","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'ADMM' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["ADMM-Q","MEL-ADMM","ADMM-RGP","sMEL-ADMM","FedF-ADMM","Sheaf-ADMM","SPIDER-ADMM","FedNPG-ADMM"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"8a9f9cc562a24a2637b31659b1cf9f1ad37e79d2d29d60953d87a33edacc2461","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}