Global convergence analysis of sparse regular nonconvex optimization problems

DOI10.13548/J.SXZZ.2019.06.005zbMATH Open1449.90297MaRDI QIDQ3307901FDOQ3307901

Authors: Min Chu 

Publication date: 12 August 2020

Recommendations

• Global convergence of proximal iteratively reweighted algorithm
• Sparse optimization on measures with over-parameterized gradient descent
• Convergence analyses on sparse feedforward neural networks via group lasso regularization
• On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems

zbMATH Keywords

sparse regularizationproximal gradientnonconvex composite optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cited In (17)

• Convergence analyses on sparse feedforward neural networks via group lasso regularization
• Title not available (Why is that?)
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion
• On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds
• Deterministic convergence analysis via smoothing group Lasso regularization and adaptive momentum for Sigma-Pi-Sigma neural network
• Analysis of multi-stage convex relaxation for sparse regularization
• Stochastic proximal linear method for structured non-convex problems
• Convergence analysis of critical point regularization with non-convex regularizers
• Convergence Rates of Training Deep Neural Networks via Alternating Minimization Methods
• Linearly constrained nonsmooth optimization for training autoencoders
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
• Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
• Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
• Make \(\ell_1\) regularization effective in training sparse CNN
• Sparse optimization on measures with over-parameterized gradient descent
• Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer

This page was built for publication: Global convergence analysis of sparse regular nonconvex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3307901)