A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
From MaRDI portal
Publication:2848188
DOI10.1137/120891009zbMath1273.90123arXiv1209.2385OpenAlexW2050968963WikidataQ84989623 ScholiaQ84989623MaRDI QIDQ2848188
Zhi-Quan Luo, Meisam Razaviyayn, Mingyi Hong
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.2385
block coordinate descentsuccessive convex approximationblock successive upper-bound minimizationsuccessive inner approximation
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Estimation and detection in stochastic control theory (93E10) Methods of successive quadratic programming type (90C55) Communication theory (94A05)
Related Items
Spatial clustering of time series via mixture of autoregressions models and Markov random fields, The convergence properties of infeasible inexact proximal alternating linearized minimization, On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods, Local linear convergence of proximal coordinate descent algorithm, Open issues and recent advances in DC programming and DCA, Laplace mixture autoregressive models, Block Bregman Majorization Minimization with Extrapolation, Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes, Multiview clustering via exclusive non-negative subspace learning and constraint propagation, Generalized co-sparse factor regression, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal, A Unified Framework for Structured Graph Learning via Spectral Constraints, A convergent least-squares regularized blind deconvolution approach, Nonparametric mean-lower partial moment model and enhanced index investment, A proximal block minimization method of multipliers with a substitution procedure, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, Visualizing the effects of a changing distance on data using continuous embeddings, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Linear mixed models with marginally symmetric nonparametric random effects, Maximum likelihood estimation of triangular and polygonal distributions, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, A globally convergent algorithm for Lasso-penalized mixture of linear regression models, An expectation-maximization algorithm for blind separation of noisy mixtures using Gaussian mixture model, A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure, Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs, A globally convergent algorithm for nonconvex optimization based on block coordinate update, A survey on deep matrix factorizations, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, Scalable Collaborative Ranking for Personalized Prediction, Maximum likelihood estimation of Gaussian mixture models without matrix operations, A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors, Group collaborative representation for image set classification, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, Matrix factorization for low-rank tensor completion using framelet prior, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, Randomized mixture models for probability density approximation and estimation, Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Wideband MIMO radar transmit beampattern synthesis via majorization-minimization, Computing B-Stationary Points of Nonsmooth DC Programs, Unnamed Item, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Maximum Pseudolikelihood Estimation for Model-Based Clustering of Time Series Data, Alternating Proximal Regularized Dictionary Learning, Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version, Variable metric techniques for forward-backward methods in imaging, Large-scale unit commitment under uncertainty: an updated literature survey, A cyclic block coordinate descent method with generalized gradient projections, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, On the pervasiveness of difference-convexity in optimization and statistics, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, An inexact PAM method for computing Wasserstein barycenter with unknown supports, Unnamed Item, Pathwise coordinate optimization for sparse learning: algorithm and theory, DC programming and DCA: thirty years of developments, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, Tensor completion using total variation and low-rank matrix factorization, Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications, Iteratively Reweighted Group Lasso Based on Log-Composite Regularization, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization, Improving the accuracy of LDG approximations on coarse meshes, Iteration complexity analysis of block coordinate descent methods, 3D joint hydrogeophysical inversion using similarity measures, MM for penalized estimation, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Empirical Bayesian learning in AR graphical models, An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem, Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence, A block coordinate variable metric forward-backward algorithm, A block coordinate variable metric linesearch based proximal gradient method, Toward fast transform learning, Stream-suitable optimization algorithms for some soft-margin support vector machine variants, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Hyperspectral image restoration using framelet-regularized low-rank nonnegative matrix factorization, Iterative Proportional Scaling Revisited: A Modern Optimization Perspective, A Block Successive Lower-Bound Maximization Algorithm for the Maximum Pseudo-Likelihood Estimation of Fully Visible Boltzmann Machines, Low-rank tensor completion via smooth matrix factorization, An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration, Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints, A Simple Framework for Stability Analysis of State-Dependent Networks of Heterogeneous Agents, An efficient alternating minimization method for fourth degree polynomial optimization, The Dynamics of Swamps in the Canonical Tensor Approximation Problem, Code design for moving target-detecting radar in nonhomogeneous signal-dependent clutter, Learning Optimal Distributionally Robust Individualized Treatment Rules, The regularized feasible directions method for nonconvex optimization, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Outlier accommodation in moving‐horizon state estimation: A risk‐averse performance‐specified approach, Low-rank tensor completion using matrix factorization based on tensor train rank and total variation, A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence, Unnamed Item, A generic coordinate descent solver for non-smooth convex optimisation, Coordinate descent algorithms, Sequential support points, Large-scale unit commitment under uncertainty, On the convergence of inexact block coordinate descent methods for constrained optimization
Uses Software
