A coordinate gradient descent method for nonsmooth separable minimization
From MaRDI portal
Publication:959979
DOI10.1007/S10107-007-0170-0zbMATH Open1166.90016OpenAlexW2039050532MaRDI QIDQ959979FDOQ959979
Authors: Paul Tseng, Sangwoon Yun 
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0170-0
Recommendations
- A coordinate gradient descent method for nonsmooth nonseparable minimization
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- On the iteration complexity of cyclic coordinate gradient descent methods
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)
Cites Work
- Testing Unconstrained Optimization Software
- Algorithm 778: L-BFGS-B
- CUTEr and SifDec
- Numerical Optimization
- Ideal spatial adaptation by wavelet shrinkage
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Adapting to Unknown Smoothness via Wavelet Shrinkage
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Model Selection and Estimation in Regression with Grouped Variables
- The Group Lasso for Logistic Regression
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- Convex Analysis
- A coordinate gradient descent method for nonsmooth separable minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method for minimizing the sum of a convex function and a continuously differentiable function
- A minimization method for the sum of a convex function and a continuously differentiable function
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Title not available (Why is that?)
- Some continuity properties of polyhedral multifunctions
- A generalized proximal point algorithm for certain non-convex minimization problems
- Title not available (Why is that?)
- Trust Region Methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Accurate Identification of Active Constraints
- Iterative Solution of Nonlinear Equations in Several Variables
- On search directions for minimization algorithms
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Descent methods for composite nondifferentiable optimization problems
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Mathematical Programming for Data Mining: Formulations and Challenges
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Parallel Variable Transformation in Unconstrained Optimization
- Parallel Gradient Distribution in Unconstrained Optimization
- Parallel Variable Distribution
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Dual coordinate ascent methods for non-strictly convex minimization
- A model algorithm for composite nondifferentiable optimization problems
- Large scale kernel regression via linear programming
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- On the Statistical Analysis of Smoothing by Maximizing Dirty Markov Random Field Posterior Distributions
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
Cited In (only showing first 100 items - show all)
- An inexact Riemannian proximal gradient method
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- Toward Optimal Fingerprinting in Detection and Attribution of Changes in Climate Extremes
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
- A coordinate descent method for total variation minimization
- Primal path algorithm for compositional data analysis
- On the convergence of the forward–backward splitting method with linesearches
- Accelerating block coordinate descent methods with identification strategies
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
- Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
- Kurdyka-Łojasiewicz property of zero-norm composite functions
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- Kurdyka-Łojasiewicz exponent via inf-projection
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
- Beetle swarm optimization algorithm: Theory and application
- Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- Dynamical modeling for non-Gaussian data with high-dimensional sparse ordinary differential equations
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Bayesian adaptive lasso with variational Bayes for variable selection in high-dimensional generalized linear mixed models
- Block coordinate type methods for optimization and learning
- A proximal interior point algorithm with applications to image processing
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Block mirror stochastic gradient method for stochastic optimization
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- Overlapping Domain Decomposition Methods for Total Variation Denoising
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization
- A joint estimation approach to sparse additive ordinary differential equations
- Achieving the oracle property of OEM with nonconvex penalties
- The generalized equivalence of regularization and min-max robustification in linear mixed models
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction
- Markov chain block coordinate descent
- A new convergence analysis for the Volterra series representation of nonlinear systems
- A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization
- New convergence results for the inexact variable metric forward-backward method
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- An elastic net penalized small area model combining unit- and area-level data for regional hypertension prevalence estimation
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization
- High-performance statistical computing in the computing environments of the 2020s
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- Nomonotone spectral gradient method for sparse recovery
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Inexact coordinate descent: complexity and preconditioning
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- Variable selection for sparse Dirichlet-multinomial regression with an application to microbiome data analysis
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A new generalized shrinkage conjugate gradient method for sparse recovery
- A generic coordinate descent solver for non-smooth convex optimisation
- Robust Variable Selection With Exponential Squared Loss
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- Sparse group Lasso and high dimensional multinomial classification
- Robust sparse Gaussian graphical modeling
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Block Coordinate Descent Methods for Semidefinite Programming
- Projection onto a polyhedron that exploits sparsity
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Incrementally updated gradient methods for constrained and regularized optimization
- Fused Multiple Graphical Lasso
- On the convergence of an active-set method for ℓ1minimization
- On some steplength approaches for proximal algorithms
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- An efficient inexact ABCD method for least squares semidefinite programming
- Estimation for high-dimensional linear mixed-effects models using \(\ell_1\)-penalization
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- The Group Lasso for Logistic Regression
- An iterative approach for cone complementarity problems for nonsmooth dynamics
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- Solution path clustering with adaptive concave penalty
- On the complexity analysis of randomized block-coordinate descent methods
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- X-ray CT image reconstruction via wavelet frame based regularization and Radon domain inpainting
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- A convergent decomposition method for box-constrained optimization problems
Uses Software
This page was built for publication: A coordinate gradient descent method for nonsmooth separable minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959979)
