On the convergence of the coordinate descent method for convex differentiable minimization

DOI10.1007/BF00939948zbMath0795.90069OpenAlexW2013850411WikidataQ56451839 ScholiaQ56451839MaRDI QIDQ1321135

Paul Tseng, Zhi-Quan Luo

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939948

zbMATH Keywords

entropy optimizationmatrix balancingconvex differentiable minimizationcoordinate descent methodsymmetric monotone linear complementarity

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (only showing first 100 items - show all)

Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices ⋮ Toric geometry of entropic regularization ⋮ Local linear convergence of proximal coordinate descent algorithm ⋮ A bicomposition of conical projections ⋮ Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent ⋮ A generic coordinate descent solver for non-smooth convex optimisation ⋮ A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization ⋮ A block coordinate descent method for sensor network localization ⋮ Parallel block coordinate minimization with application to group regularized regression ⋮ Globally convergent block-coordinate techniques for unconstrained optimization ⋮ Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition ⋮ An off-grid block-sparse Bayesian method for direction of arrival and polarization estimation ⋮ Error bounds for inconsistent linear inequalities and programs ⋮ The Cyclic Block Conditional Gradient Method for Convex Optimization Problems ⋮ A convergent decomposition method for box-constrained optimization problems ⋮ An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization ⋮ Influence of forecasting electricity prices in the optimization of complex hydrothermal systems ⋮ A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems ⋮ Distributed Block Coordinate Descent for Minimizing Partially Separable Functions ⋮ Error estimates and Lipschitz constants for best approximation in continuous function spaces ⋮ A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise ⋮ Error bounds in mathematical programming ⋮ Unnamed Item ⋮ Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ On the Linear Convergence of the Multimarginal Sinkhorn Algorithm ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ New method for solving Ivanov regularization-based support vector machine learning ⋮ Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization ⋮ Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications ⋮ A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS ⋮ An almost cyclic 2-coordinate descent method for singly linearly constrained problems ⋮ Randomness and permutations in coordinate descent methods ⋮ Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties ⋮ 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 ⋮ Optimal Point Sets for Quasi-Monte Carlo Integration of Bivariate Periodic Functions with Bounded Mixed Derivatives ⋮ A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming ⋮ Dual coordinate descent methods for logistic regression and maximum entropy models ⋮ Manifold optimization for hybrid beamforming in dual-function radar-communication system ⋮ X-ray CT image reconstruction via wavelet frame based regularization and Radon domain inpainting ⋮ Synchronous parallel block coordinate descent method for nonsmooth convex function minimization ⋮ Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm ⋮ Global convergence of a modified gradient projection method for convex constrained problems ⋮ On New Classes of Nonnegative Symmetric Tensors ⋮ Greedy and randomized versions of the multiplicative Schwarz method ⋮ An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems ⋮ On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ Developing integer calibration weights for census of agriculture ⋮ Stochastic block-coordinate gradient projection algorithms for submodular maximization ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ Randomized Hessian estimation and directional search ⋮ On convergence rate of the randomized Gauss-Seidel method ⋮ Cyclic coordinate descent in hydrothermal nonsmooth problems ⋮ On the convergence of the block nonlinear Gauss-Seidel method under convex constraints ⋮ On the complexity analysis of randomized block-coordinate descent methods ⋮ Nonsmooth Variants of Powell's BFGS Convergence Theorem ⋮ Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ Pathwise coordinate optimization for sparse learning: algorithm and theory ⋮ GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression ⋮ Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ⋮ On the linear convergence of the alternating direction method of multipliers ⋮ Advanced algorithms for penalized quantile and composite quantile regression ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Iteration complexity analysis of block coordinate descent methods ⋮ Schwarz iterative methods: infinite space splittings ⋮ A coordinate descent based method for geometry optimization of trusses ⋮ Optimal control of counter-terrorism tactics ⋮ Rolling-horizon replenishment: Policies and performance analysis ⋮ Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM ⋮ A block coordinate variable metric forward-backward algorithm ⋮ Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations ⋮ A class of problems for which cyclic relaxation converges linearly ⋮ Block Coordinate Descent Methods for Semidefinite Programming ⋮ An application of the algorithm of the cyclic coordinate descent in multidimensional optimization problems with constrained speed ⋮ A parallel line search subspace correction method for composite convex optimization ⋮ Toward fast transform learning ⋮ Large-Scale Training of SVMs with Automata Kernels ⋮ Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning ⋮ The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program ⋮ Conducting sparse feature selection on arbitrarily long phrases in text corpora with a focus on interpretability ⋮ Randomized Gradient Boosting Machine ⋮ A hybrid acceleration strategy for nonparallel support vector machine ⋮ Domain decomposition for entropy regularized optimal transport ⋮ A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization ⋮ Mid-term bio-economic optimization of multi-species fisheries ⋮ Iterative Proportional Scaling Revisited: A Modern Optimization Perspective ⋮ Analysis of supply contracts with quantity flexibility ⋮ Maximum likelihood estimation in Gaussian models under total positivity ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ Accelerate stochastic subgradient method by leveraging local growth condition ⋮ An alternating algorithm for finding linear Arrow-Debreu market equilibria ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ Numerical approximation to ODEs using the error functional ⋮ Double-counting problem of the bonus-malus system ⋮ Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem ⋮ Computing non-negative tensor factorizations ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of Hildreth's quadratic programming algorithm
• A new polynomial-time algorithm for linear programming
• Vector and parallel computing for matrix balancing
• A relaxed version of Bregman's method for convex programming
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• An algorithm for maximizing entropy subject to simple bounds
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• An iterative row-action method for interval convex programming
• Decomposition algorithm for convex differentiable minimization
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Bounds for error in the solution set of a perturbed linear program
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
• On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• A Comparative Study of Algorithms for Matrix Balancing
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Convex Analysis
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• Computation of channel capacity and rate-distortion functions
• Generalized Iterative Scaling for Log-Linear Models
• On search directions for minimization algorithms
• On the convergence of sequential minimization algorithms

This page was built for publication: On the convergence of the coordinate descent method for convex differentiable minimization