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.

• Hyperspectral image restoration using framelet-regularized low-rank nonnegative matrix factorization (Q2306920) (← links)
• Low-rank tensor completion via smooth matrix factorization (Q2310630) (← links)
• Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints (Q2315079) (← links)
• Low-rank tensor completion using matrix factorization based on tensor train rank and total variation (Q2333730) (← 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)
• Maximum likelihood estimation of Gaussian mixture models without matrix operations (Q2418406) (← links)
• Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
• Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs (Q2665379) (← links)
• A survey on deep matrix factorizations (Q2668399) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• Wideband MIMO radar transmit beampattern synthesis via majorization-minimization (Q2700500) (← 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 Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
• Iterative Proportional Scaling Revisited: A Modern Optimization Perspective (Q3391182) (← 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)
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
• A Unified Framework for Structured Graph Learning via Spectral Constraints (Q4969059) (← links)
• Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory (Q4993287) (← links)
• Learning Optimal Distributionally Robust Individualized Treatment Rules (Q4999141) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• Outlier accommodation in moving‐horizon state estimation: A risk‐averse performance‐specified approach (Q5000694) (← links)
• (Q5018953) (← links)
• Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
• Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
• Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
• (Q5053179) (← links)
• A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
• (Q5155916) (← links)
• Iteratively Reweighted Group Lasso Based on Log-Composite Regularization (Q5161764) (← links)
• The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
• An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
• A Simple Framework for Stability Analysis of State-Dependent Networks of Heterogeneous Agents (Q5232204) (← links)
• The Dynamics of Swamps in the Canonical Tensor Approximation Problem (Q5238232) (← 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)
• A Block Successive Lower-Bound Maximization Algorithm for the Maximum Pseudo-Likelihood Estimation of Fully Visible Boltzmann Machines (Q5380400) (← links)
• Maximum Pseudolikelihood Estimation for Model-Based Clustering of Time Series Data (Q5380690) (← links)
• Alternating Proximal Regularized Dictionary Learning (Q5383811) (← links)
• A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
• Convergence of a block coordinate descent method for nondifferentiable minimization (Q5945065) (← links)
• Scalable Collaborative Ranking for Personalized Prediction (Q6040680) (← links)