Proximal alternating linearized minimization for nonconvex and nonsmooth problems

2013/07/25 by Jérôme Bolte, Shoham Sabach, Marc Teboulle · 1,734 citations
Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Applied mathematics #Bounded function #Class (philosophy) #Computer science #Convergence (economics) #Convexity #Mathematical analysis #Mathematical optimization #Mathematics #Minification #Optimization and Variational Analysis #Property (philosophy) #Sequence (biology) #Sparse and Compressive Sensing Techniques #Variety (cybernetics)

paper · doi:10.1007/s10107-013-0701-9

published in Mathematical Programming 146(1-2), 459-494 (Springer Science+Business Media)

openalex publication_date 2013/07/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Citations

• Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods

Cited by

• From error bounds to the complexity of first-order descent methods for convex functions
• An exact penalty approach for optimization with nonnegative orthogonality constraints
• Riemannian proximal gradient methods
• CADMM-Prox: A Bi-level Consensus ADMM for Non-smooth Non-convex Distributed Consensus Optimization
• Learning Doubly Sparse Explicitly Conditioned Transforms
• Global Convergence of Inexact Augmented Lagrangian Method for Zero-One Composite Optimization
• Kurdyka-Łojasiewicz exponent via inf-projection
• An Efficient and Globally Convergent Algorithm for ℓ_p,q-ℓ_r Model in Group Sparse Optimization
• Clustering with feature selection using alternating minimization, Application to computational biology
• Efficient numerical methods for computing the stationary states of phase field crystal models
• NetREX: Network Rewiring using EXpression - Towards Context Specific Regulatory Networks
• Difference-of-Convex Elastic Net for Compressed Sensing
• On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
• Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems
• The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension
• Robust Entity Alignment for Fuzzy Temporal Knowledge Graphs via Dynamic Vector Transformation and Optimal Transport
• Alternating Direction Method of Multipliers for A Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing
• C-SALT: Mining Class-Specific ALTerations in Boolean Matrix Factorization
• Non-smooth Variable Projection
• Group-sparse SVD Models and Their Applications in Biological Data
• Optimal Rank Selection for Nonnegative Matrix Factorization via ℓ_2,0-Norm Regularization
• Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis
• Learning from the Descent Direction: Adaptive Gradient Descent under One-Sided Hölder Regularity
• Composite Difference-Max Programs for Modern Statistical Estimation Problems
• Coupled dictionary learning for unsupervised change detection between multi-sensor remote sensing images
• A Proximal Method for Composite Optimization with Smooth and Convex Components
• A preconditioned second-order convex splitting algorithm with extrapolation
• Convergence guarantees for a class of non-convex and non-smooth optimization problems
• Coordinate Descent Algorithms
• Convergent and efficient iteratively regularized contrast source inversion-type methods for inverse medium scattering problems
• The value function approach to convergence analysis in composite optimization
• The exact modulus of the generalized concave Kurdyka-Łojasiewicz property
• A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
• Convergence of multi-block Bregman ADMM for nonconvex composite problems
• A novel multi-exposure-to-multi-mediator mediation model for imaging genetic study of brain disorders
• Worst-Case Load Shedding in Electric Power Networks
• iFCTN: an intra-block Fully-Connected Tensor Network Decomposition for Tensor Completion
• DCA based Algorithm with Extrapolation for Nonconvex Nonsmooth Optimization
• Hyperspectral Super-Resolution with Inter-Image Variability via Degradation-based Low-Rank and Residual Fusion Method
• Two-stage toeplitz quasi-likelihood screening-refit for unknown-source-number DOA estimation with fully augmentable arrays
• Computing B-Stationary Points of Nonsmooth DC Programs
• Massive Access in Secure NOMA under Imperfect CSI: Security Guaranteed Sum-Rate Maximization with First-Order Algorithm
• Kurdyka-Lojasiewicz Property of Zero-Norm Composite Functions
• Time series forecasting from partial observations via Non-negative Matrix Factorization
• Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
• Non-Negative Stiefel Approximating Flow: Orthogonalish Matrix Optimization for Interpretable Embeddings
• Sparsity via Hyperpriors: A Theoretical and Algorithmic Study under Empirical Bayes Framework
• An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
• A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
• Variable Smoothing Alternating Proximal Gradient Algorithm for Coupled Composite Optimization
• A flexible block-coordinate forward-backward algorithm for non-smooth and non-convex optimization
• Long term dynamics of the subgradient method for Lipschitz path differentiable functions
• A two-level distributed algorithm for nonconvex constrained optimization
• Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry
• On the convergence of higher-order orthogonality iteration
• FasTer: Fast Tensor Completion with Nonconvex Regularization
• Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants
• Hyperspectral unmixing with spectral variability using a perturbed linear mixing model
• An iterative support shrinking algorithm for \ℓ_p-\ℓ_q\n minimization
• Comparison-Based Algorithms for One-Dimensional Stochastic Convex Optimization
• Blind inverse problems with isolated spikes
• PENDANTSS: PEnalized Norm-ratios Disentangling Additive Noise, Trend and Sparse Spikes
• Solving Optimization Problems over the Stiefel Manifold by Smooth Exact Penalty Function
• Stochastic Optimization for Non-convex Inf-Projection Problems
• Game-Theoretic Mixed H₂/H_∞ Control with Sparsity Constraint for Multi-agent Networked Control Systems
• Non-ergodic Complexity of Convex Proximal Inertial Gradient Descents
• Extended ADMM and BCD for Nonseparable Convex Minimization Models with Quadratic Coupling Terms: Convergence Analysis and Insights
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Stochastic Gradient Descent for Stochastic Doubly-Nonconvex Composite Optimization
• A stroll in the jungle of error bounds
• First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
• Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
• Optimization of Bregman Variational Learning Dynamics
• Exact Sparse Orthogonal Dictionary Learning
• Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
• Learning Multi-Index Models with Hyper-Kernel Ridge Regression
• A Proximal Linearization-based Decentralized Method for Nonconvex Problems with Nonlinear Constraints
• Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
• Overlapping Domain Decomposition Methods for Ptychographic Imaging
• Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms
• Joint deconvolution and blind source separation on the sphere with an application to radio-astronomy
• Wavelet inpainting with the ℓ0 sparse regularization
• Nonlinear matrix recovery using optimization on the Grassmann manifold
• Conservative set valued fields, automatic differentiation, stochastic gradient method and deep learning
• On the Convergence of Learning-based Iterative Methods for Nonconvex Inverse Problems
• A two-level distributed algorithm for nonconvex constrained optimization
• Solving NMF with smoothness and sparsity constraints using PALM
• A Scale Invariant Approach for Sparse Signal Recovery
• Joint Cooperative and Non-Cooperative Localization in WSNs with Distributed Scaled Proximal ADMM Algorithms
• On the Convergence of Muon and Beyond
• Joint Learning of Panel VAR models with Low Rank and Sparse Structure
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
• A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems
• Simple linesearch-free first-order methods for nonconvex optimization
• Low Rank Approximation of Tensors via Sparse Optimization
• On Accelerating the Regularized Alternating Least Square Algorithm for Tensors
• Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
• Convergence of Bregman alternating direction method with multipliers for nonconvex composite problems
• Constraint hypergraph partitioning problems via recursive bipartition algorithm based on improved Dai–Kou conjugate gradient algorithm
• A preconditioned third-order implicit-explicit algorithm with a difference of varying convex functions and extrapolation
• A new nonlocal low-rank regularization method with applications to magnetic resonance image denoising
• An Inexact Riemannian Proximal Gradient Method
• A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
• A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
• Accelerated Block Coordinate Proximal Gradients with Applications in High Dimensional Statistics
• Solving Imaging Inverse Problems Using Plug-and-Play Denoisers: Regularization and Optimization Perspectives
• Practical Detection of Trojan Neural Networks: Data-Limited and Data-Free Cases
• Controllability maximization of large-scale systems using projected gradient method
• Deeply-Sparse Signal rePresentations (DS²P)
• Iteratively reweighted ℓ ₁ ℓ 1 algorithms with extrapolation
• Accelerated Proximal Dogleg Majorization for Sparse Regularized Quadratic Optimization Problem
• A Semismooth Newton based Augmented Lagrangian Method for Nonsmooth Optimization on Matrix Manifolds
• Supervised Stochastic Gradient Algorithms for Multi-Trial Source Separation
• Efficient Rank Minimization via Solving Non-convexPenalties by Iterative Shrinkage-Thresholding Algorithm
• A New Inexact Manifold Proximal Linear Algorithm with Adaptive Stopping Criteria
• Constrained Optimization via Constraint-Induced Geometry: Implicit Feasible Dynamics and Optimality from Stationarity
• A smoothed proximal trust-region algorithm for nonconvex optimization problems with L^p-regularization, p∈ (0,1)
• An inexact variable metric proximal linearization method for composite optimization on manifolds
• Block Distributed Majorize-Minimize Memory Gradient Algorithm and its application to 3D image restoration
• A Convergent Generalized Krylov Subspace Method for Compressed Sensing MRI Reconstruction with Gradient-Driven Denoisers
• Provable Bregman-divergence based Methods for Nonconvex and Non-Lipschitz Problems
• Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints
• LRTuckerRep: Low-rank Tucker Representation Model for Multi-dimensional Data Completion
• ConFuse: Convolutional Transform Learning Fusion Framework For\n Multi-Channel Data Analysis
• The Kurdyka-Łojasiewicz inequality as regularity condition
• LAMA-Net: A Convergent Network Architecture for Dual-Domain Reconstruction
• Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Non-Penalty Approach
• An inexact alternating projection method with application to matrix completion
• Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion
• A Preconditioned Difference of Convex Algorithm for Truncated Quadratic Regularization with Application to Imaging
• Speech Enhancement with Dual-path Multi-Channel Linear Prediction Filter and Multi-norm Beamforming
• General Proximal Quasi-Newton Methods based on model functions for nonsmooth nonconvex problems
• Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
• Low Tensor Train- and Low Multilinear Rank Approximations for De-speckling and Compression of 3D Optical Coherence Tomography Images
• Gradient descent in a generalised Bregman distance framework
• Model Function Based Conditional Gradient Method with Armijo-like Line Search
• An efficient method for computing stationary states of phase field crystal models
• QuPeL: Quantized Personalization with Applications to Federated Learning
• On the Łojasiewicz Exponent of the Quadratic Sphere Constrained Optimization Problem
• Effective Two-Stage Image Segmentation: A New Non-Lipschitz Decomposition Approach with Convergent Algorithm
• Robust Deep Learning for Uplink Channel Estimation in Cellular Network Under Inter-Cell Interference
• Inertial Bregman Proximal Gradient Algorithm For Nonconvex Problem with Smooth Adaptable Property
• Bregman Proximal Framework for Deep Linear Neural Networks
• Optimization of Inf-Convolution Regularized Nonconvex Composite Problems
• Group Knowledge Transfer: Federated Learning of Large CNNs at the Edge
• Current Advances in Computational Lung Ultrasound Imaging: A Review
• A note on alternating minimization algorithms: Bregman frame
• Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
• Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
• Fast Equivariant Imaging: Accelerating Unsupervised Learning and Model Adaptation via Inexact Splitting
• Deep Online Convex Optimization with Gated Games
• Leveraging Two Reference Functions in Block Bregman Proximal Gradient Descent for Non-convex and Non-Lipschitz Problems
• Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex\n optimization problems
• Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
• A Self-scaled Approximate ℓ₀ Regularization Robust Model for Outlier Detection
• Unsupervised Multi Class Segmentation of 3D Images with Intensity\n Inhomogeneities
• Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
• A Non-monotone Alternating Updating Method for A Class of Matrix Factorization Problems
• Nonconvex Approach for Sparse and Low-Rank Constrained Models with Dual Momentum
• Inexact Proximal Gradient Methods for Non-convex and Non-smooth Optimization
• Relax-and-split method for nonsmooth nonconvex problems
• An Alternating Manifold Proximal Gradient Method for Sparse PCA and Sparse CCA
• Learning a collaborative multiscale dictionary based on robust empirical mode decomposition
• Every critical point of an L0 composite minimization problem is a local minimizer
• A Preconditioned Alternating Minimization Framework for Nonconvex and Half Quadratic Optimization
• Image denoising based on improved data-driven sparse representation
• Dictionary Learning Based Regularization in Quantitative MRI: A Nested Alternating Optimization Framework
• A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems
• On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
• TMAC: A Toolbox of Modern Async-Parallel, Coordinate, Splitting, and Stochastic Methods
• Learning Robust Representations for Computer Vision
• Bregman Proximal Gradient Algorithm with Extrapolation for a class of Nonconvex Nonsmooth Minimization Problems
• MOCCA: mirrored convex/concave optimization for nonconvex composite functions
• Efficient Proximal Mapping of the 1-path-norm of Shallow Networks
• Short-and-Sparse Deconvolution -- A Geometric Approach
• Dictionary Learning with Low-rank Coding Coefficients for Tensor Completion
• Distributed proximal gradient algorithm for non-smooth non-convex optimization over time-varying networks
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
• Convergence rates of regularized quasi-Newton methods without strong convexity
• Searching to Exploit Memorization Effect in Learning from Corrupted Labels
• Proximal Iterative Hard Thresholding Algorithm for Sparse Group ℓ₀-Regularized Optimization with Box Constraint
• Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound
• Algorithms for Difference-of-Convex (DC) Programs Based on Difference-of-Moreau-Envelopes Smoothing
• A full splitting algorithm for structured difference-of-convex programs
• Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints
• Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion
• Structured Sparse Non-negative Matrix Factorization with L20-Norm for scRNA-seq Data Analysis
• Multi-Tensor Network Representation for High-Order Tensor Completion
• Learning Low-Complexity Autoregressive Models via Proximal Alternating Minimization
• On anisotropic non-Lipschitz restoration model: lower bound theory and convergent algorithm
• Alternating and Parallel Proximal Gradient Methods for Nonsmooth, Nonconvex Minimax: A Unified Convergence Analysis
• Bi-Level Unsupervised Feature Selection
• Relating lp regularization and reweighted l1 regularization
• A Nonconvex Proximal Splitting Algorithm under Moreau-Yosida Regularization
• Learning computationally efficient dictionaries and their implementation as fast transforms
• Gradient Primal-Dual Algorithm Converges to Second-Order Stationary Solutions for Nonconvex Distributed Optimization
• A proximal-proximal majorization-minimization algorithm for nonconvex tuning-free robust regression problems
• Convergence of Random Reshuffling Under The Kurdyka-Łojasiewicz Inequality
• A proximal DC approach for quadratic assignment problem
• Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
• On Collaborative Compressive Sensing Systems: The Framework, Design and Algorithm
• An Extension of Fast Iterative Shrinkage-thresholding to Riemannian Optimization for Sparse Principal Component Analysis
• The Boosted DC Algorithm for nonsmooth functions
• Bridging Predictive Coding and MDL: A Two-Part Code Framework for Deep Learning
• New Analysis of Linear Convergence of Gradient-type Methods via Unifying Error Bound Conditions
• Misspecified Nonconvex Statistical Optimization for Phase Retrieval
• Rank Approximation of a Tensor with Applications in Color Image and Video Processing
• An accelerated proximal iterative hard thresholding method for ℓ₀ minimization
• Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization
• An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization
• A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion
• L⁰-regularized Variational Methods for Sparse Phase Retrieval
• Multiplicative Noise Removal: Nonlocal Low-Rank Model and Its Proximal Alternating Reweighted Minimization Algorithm
• A Hölderian backtracking method for min-max and min-min problems
• On The Geometric Analysis of A Quartic-quadratic Optimization Problem under A Spherical Constraint
• Analysis of nonsmooth stochastic approximation: the differential inclusion approach
• Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma
• Robust Principal Component Analysis: A Construction Error Minimization Perspective
• PALMNUT: An Enhanced Proximal Alternating Linearized Minimization Algorithm with Application to Separate Regularization of Magnitude and Phase
• Fast Computation of Free-Support Wasserstein Medians
• Nonconvex Penalization in Sparse Estimation: An Approach Based on the Bernstein Function
• KL property of exponent 1/2 of quadratic functions under nonnegative zero-norm constraints and applications
• Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-Łojasiewicz Inequality
• A three-operator splitting algorithm for nonconvex sparsity regularization
• Optimized Structured Sparse Sensing Matrices for Compressive Sensing
• A refined convergence analysis of pDCA_e with applications to simultaneous sparse recovery and outlier detection
• On the Role of Batch Size in Stochastic Conditional Gradient Methods
• A proximal difference of convex functions algorithm using Barzilai-Borwein step size with nonmonotone line search and extrapolation
• A geometry-based deep equilibrium model for image restoration under multiplicative Gamma noise
• On the Iterate Convergence of Bregman Projected Gradient Method
• A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
• Compact representation of temporal processes in echosounder time series via matrix decomposition
• SG-PALM: a Fast Physically Interpretable Tensor Graphical Model
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Nonconvex Regularization Based Sparse Recovery and Demixing with Application to Color Image Inpainting
• Convergence rate analysis of nonconvex nonmonotone descent methods under the Hölderian value proximity error bound condition
• Convergence Analysis of an Inexact MBA Method for Constrained DC Problems
• Global Optimality in Distributed Low-rank Matrix Factorization
• Joint deconvolution and unsupervised source separation for data on the sphere
• Inertial Nonconvex Alternating Minimizations for the Image Deblurring
• A Robust Time Series Model with Outliers and Missing Entries
• An Inertial Block Proximal Linearized Method with Adaptive Momentum for Nonconvex and Nonsmooth Optimization
• A proximal subgradient method for nonconvex stochastic optimization under the Kurdyka-Łojasiewicz condition
• GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
• Inertial proximal alternating minimization for nonconvex and nonsmooth problems. [europepmc]
• Reprogramming of regulatory network using expression uncovers sex-specific gene regulation in Drosophila. [europepmc]
• A convergent relaxation of the Douglas-Rachford algorithm. [europepmc]
• Real-time 3D reconstruction from single-photon lidar data using plug-and-play point cloud denoisers. [europepmc]
• A general double-proximal gradient algorithm for d.c. programming. [europepmc]
• A second-order dynamical approach with variable damping to nonconvex smooth minimization. [europepmc]
• Computational optical imaging with a photonic lantern. [europepmc]
• Correntropy Based Matrix Completion. [europepmc]
• Sparse Blind Deconvolution with Nonconvex Optimization for Ultrasonic NDT Application. [europepmc]
• Discrete Two-Step Cross-Modal Hashing through the Exploitation of Pairwise Relations. [europepmc]
• Spatially Coherent Clustering Based on Orthogonal Nonnegative Matrix Factorization. [europepmc]
• Co-sparse Non-negative Matrix Factorization. [europepmc]
• MobilePrune: Neural Network Compression via ℓ 0 Sparse Group Lasso on the Mobile System. [europepmc]
• A Sparse Mixture-of-Experts Model With Screening of Genetic Associations to Guide Disease Subtyping. [europepmc]
• NetREX-CF integrates incomplete transcription factor data with gene expression to reconstruct gene regulatory networks. [europepmc]
• A New Regularization for Deep Learning-Based Segmentation of Images with Fine Structures and Low Contrast. [europepmc]
• A unified framework for focal intensity change detection and deformable image registration. Application to the monitoring of multiple sclerosis lesions in longitudinal 3D brain MRI. [europepmc]
• XMR: an explainable multimodal neural network for drug response prediction. [europepmc]
• Graph regularized non-negative matrix factorization with L 2 , 1 norm regularization terms for drug-target interactions prediction. [europepmc]
• Towards retrospective motion correction and reconstruction for clinical 3D brain MRI protocols with a reference contrast. [europepmc]
• Three layered sparse dictionary learning algorithm for enhancing the subject wise segregation of brain networks. [europepmc]
• Efficient parameter identification using nonsmooth and nonconvex regularization for inverse problem of diffuse optical tomography. [europepmc]
• Coancestry superposed on admixed populations yields measures of relatedness at individual-level resolution. [europepmc]
• Variability Regularized Feature Selection (VaRFS) for optimal identification of robust and discriminable features from medical imaging. [europepmc]
• Product-of-Gaussian-mixture diffusion models for joint nonlinear MRI reconstruction. [europepmc]