Pages that link to "Item:Q2848188"
From MaRDI portal
The following pages link to A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization (Q2848188):
Displayed 36 items.
- Laplace mixture autoregressive models (Q273686) (← links)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications (Q683737) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- A convergent least-squares regularized blind deconvolution approach (Q1636832) (← links)
- Visualizing the effects of a changing distance on data using continuous embeddings (Q1658724) (← links)
- Linear mixed models with marginally symmetric nonparametric random effects (Q1658992) (← links)
- Maximum likelihood estimation of triangular and polygonal distributions (Q1659022) (← links)
- A globally convergent algorithm for Lasso-penalized mixture of linear regression models (Q1662084) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- Pathwise coordinate optimization for sparse learning: algorithm and theory (Q1747736) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Tensor completion using total variation and low-rank matrix factorization (Q1750415) (← links)
- A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
- Toward fast transform learning (Q1799980) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
- An expectation-maximization algorithm for blind separation of noisy mixtures using Gaussian mixture model (Q2405461) (← links)
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging (Q3192655) (← links)
- A proximal block minimization method of multipliers with a substitution procedure (Q3458819) (← links)
- On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
- Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466) (← links)
- Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning (Q5254990) (← links)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)