A coordinate gradient descent method for nonsmooth separable minimization
From MaRDI portal
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)
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3722433 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 778130 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- A generalized proximal point algorithm for certain non-convex minimization problems
- 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 model algorithm for composite nondifferentiable optimization problems
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Adapting to Unknown Smoothness via Wavelet Shrinkage
- Algorithm 778: L-BFGS-B
- Atomic Decomposition by Basis Pursuit
- CUTEr and SifDec
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convex Analysis
- Descent methods for composite nondifferentiable optimization problems
- Dual coordinate ascent methods for non-strictly convex minimization
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Ideal spatial adaptation by wavelet shrinkage
- Iterative Solution of Nonlinear Equations in Several Variables
- Large scale kernel regression via linear programming
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Mathematical Programming for Data Mining: Formulations and Challenges
- Model Selection and Estimation in Regression with Grouped Variables
- Numerical Optimization
- On search directions for minimization algorithms
- On the Accurate Identification of Active Constraints
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Statistical Analysis of Smoothing by Maximizing Dirty Markov Random Field Posterior Distributions
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Parallel Gradient Distribution in Unconstrained Optimization
- Parallel Variable Distribution
- Parallel Variable Transformation in Unconstrained Optimization
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Some continuity properties of polyhedral multifunctions
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Testing Unconstrained Optimization Software
- The Group Lasso for Logistic Regression
- Trust Region Methods
- Updating Quasi-Newton Matrices with Limited Storage
- Variational Analysis
Cited in
(only showing first 100 items - show all)- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
- High-performance statistical computing in the computing environments of the 2020s
- A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization
- Block coordinate type methods for optimization and learning
- Markov chain block coordinate descent
- 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
- The generalized equivalence of regularization and min-max robustification in linear mixed models
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- Dynamical modeling for non-Gaussian data with high-dimensional sparse ordinary differential equations
- Kurdyka-Łojasiewicz property of zero-norm composite functions
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
- Accelerating block coordinate descent methods with identification strategies
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- An inexact Riemannian proximal gradient method
- Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- A coordinate descent method for total variation minimization
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- An elastic net penalized small area model combining unit- and area-level data for regional hypertension prevalence estimation
- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- New convergence results for the inexact variable metric forward-backward method
- Primal path algorithm for compositional data analysis
- A new convergence analysis for the Volterra series representation of nonlinear systems
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- Iteration complexity of a block coordinate gradient descent method for convex optimization
- Randomized block proximal damped Newton method for composite self-concordant minimization
- A joint estimation approach to sparse additive ordinary differential equations
- Beetle swarm optimization algorithm: Theory and application
- Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization
- Global convergence rate of proximal incremental aggregated gradient methods
- Kurdyka-Łojasiewicz exponent via inf-projection
- Achieving the oracle property of OEM with nonconvex penalties
- On the convergence of the forward-backward splitting method with linesearches
- Block mirror stochastic gradient method for stochastic optimization
- An efficient Peaceman-Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction
- Toward optimal fingerprinting in detection and attribution of changes in climate extremes
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Multi-objective isogeometric integrated optimization for shape control of piezoelectric functionally graded plates
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Bayesian adaptive lasso with variational Bayes for variable selection in high-dimensional generalized linear mixed models
- A proximal interior point algorithm with applications to image processing
- Overlapping domain decomposition methods for total variation denoising
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization
- Block stochastic gradient iteration for convex and nonconvex optimization
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- Robust Variable Selection With Exponential Squared Loss
- Robust least square semidefinite programming with applications
- A proximal gradient descent method for the extended second-order cone linear complementarity problem
- On the complexity analysis of randomized block-coordinate descent methods
- The Group Lasso for Logistic Regression
- 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 coordinate gradient descent method for nonsmooth separable minimization
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- \(\ell_{1}\)-penalization for mixture regression models
- Block coordinate descent methods for semidefinite programming
- Inexact coordinate descent: complexity and preconditioning
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- X-ray CT image reconstruction via wavelet frame based regularization and Radon domain inpainting
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- Main effects and interactions in mixed and incomplete data frames
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Efficient block-coordinate descent algorithms for the group Lasso
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- On the complexity of parallel coordinate descent
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A stochastic quasi-Newton method for large-scale optimization
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Sparse group Lasso and high dimensional multinomial classification
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Robust sparse Gaussian graphical modeling
- Projection onto a polyhedron that exploits sparsity
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- A second-order method for convex \(\ell_1\)-regularized optimization with active-set prediction
- Penalized estimation of directed acyclic graphs from discrete data
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- A new generalized shrinkage conjugate gradient method for sparse recovery
- A smoothing stochastic gradient method for composite optimization
- An augmented Lagrangian approach for sparse principal component analysis
- An iterative approach for cone complementarity problems for nonsmooth dynamics
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)
