A globally convergent algorithm for nonconvex optimization based on block coordinate update

DOI10.1007/s10915-017-0376-0zbMath1378.65126arXiv1410.1386OpenAlexW2963648037MaRDI QIDQ1676921

Wotao Yin, Yang-yang Xu

Publication date: 10 November 2017

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.1386

zbMATH Keywords

global convergencenonsmooth optimizationnonconvex optimizationblock coordinate descentnumerical testasymptotic convergenceKurdyka-Łojasiewicz inequalityprox-linearwhole sequence convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items

An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation, CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging, Block Bregman Majorization Minimization with Extrapolation, Convergence guarantees for a class of non-convex and non-smooth optimization problems, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, Penalized quasi-likelihood estimation of generalized Pareto regression -- consistent identification of risk factors for extreme losses, Local convergence of the heavy-ball method and iPiano for non-convex optimization, A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization, Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems, A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Unnamed Item, Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, Scalable subspace methods for derivative-free nonlinear least-squares optimization, A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors, On the convergence of asynchronous parallel iteration with unbounded delays, Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems, Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle, Misspecified nonconvex statistical optimization for sparse phase retrieval, Binned multinomial logistic regression for integrative cell-type annotation, Quaternion-based color image completion via logarithmic approximation, Local linear convergence of proximal coordinate descent algorithm, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, A two-level distributed algorithm for nonconvex constrained optimization, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Primal-dual block-proximal splitting for a class of non-convex problems, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, An inexact PAM method for computing Wasserstein barycenter with unknown supports, A block coordinate variable metric forward-backward algorithm, Gradient convergence of deep learning-based numerical methods for BSDEs, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, Provable accelerated gradient method for nonconvex low rank optimization, Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint, Modern regularization methods for inverse problems, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality, Unnamed Item, On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization, Proximal gradient method for huberized support vector machine, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, SISAL Revisited, A generic coordinate descent solver for non-smooth convex optimisation, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity

Uses Software

• GradSamp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
• Tensor Decompositions and Applications
• Nearly unbiased variable selection under minimax concave penalty
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• A fast patch-dictionary method for whole image recovery
• Subgradient method for nonconvex nonsmooth optimization
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the complexity analysis of randomized block-coordinate descent methods
• Iteration complexity analysis of block coordinate descent methods
• Smoothing methods for nonsmooth, nonconvex minimization
• Iterative hard thresholding for compressed sensing
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A coordinate gradient descent method for nonsmooth separable minimization
• On gradients of functions definable in o-minimal structures
• On the convergence of the coordinate descent method for convex differentiable minimization
• On semi- and subanalytic geometry
• On Fréchet subdifferentials
• Introductory lectures on convex optimization. A basic course.
• Coordinate-friendly structures, algorithms and applications
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Proximal gradient method for huberized support vector machine
• Adaptive restart for accelerated gradient schemes
• Alternating proximal gradient method for sparse nonnegative Tucker decomposition
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Positive tensor factorization
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Descent Methods for Nonnegative Matrix Factorization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Globally convergent block-coordinate techniques for unconstrained optimization
• Variational Analysis
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Sparse Approximate Solutions to Linear Systems
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• Learning the parts of objects by non-negative matrix factorization
• On the Convergence of Block Coordinate Descent Type Methods
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Convergence of a block coordinate descent method for nondifferentiable minimization