Pages that link to "Item:Q2848188"

The following pages link to A unified convergence analysis of block successive minimization methods for nonsmooth optimization (Q2848188):

Displaying 50 items.

• MM for penalized estimation (Q82924) (← links)
• Stream-suitable optimization algorithms for some soft-margin support vector machine variants (Q145488) (← links)
• 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)
• Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← 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)
• Code design for moving target-detecting radar in nonhomogeneous signal-dependent clutter (Q782309) (← links)
• Generalized co-sparse factor regression (Q830453) (← 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)
• An inexact PAM method for computing Wasserstein barycenter with unknown supports (Q1983867) (← links)
• Improving the accuracy of LDG approximations on coarse meshes (Q1997348) (← links)
• 3D joint hydrogeophysical inversion using similarity measures (Q2009601) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem (Q2031386) (← links)
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
• An efficient alternating minimization method for fourth degree polynomial optimization (Q2070363) (← links)
• The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
• A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence (Q2089877) (← links)
• Sequential support points (Q2110342) (← links)
• Multiview clustering via exclusive non-negative subspace learning and constraint propagation (Q2126274) (← links)
• Nonparametric mean-lower partial moment model and enhanced index investment (Q2147100) (← links)
• Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
• Group collaborative representation for image set classification (Q2193797) (← links)
• Matrix factorization for low-rank tensor completion using framelet prior (Q2195446) (← links)
• Randomized mixture models for probability density approximation and estimation (Q2200581) (← links)
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
• Variable metric techniques for forward-backward methods in imaging (Q2222135) (← links)
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
• On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
• Empirical Bayesian learning in AR graphical models (Q2280924) (← links)