Optimality and complexity for constrained optimization problems with nonconvex regularization
From MaRDI portal
Recommendations
- On constrained optimization with nonconvex regularization
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- Optimality conditions for the constrained \(L_p\)-regularization
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Complexity of unconstrained \(L_2 - L_p\) minimization
Cited in
(31)- Existence and approximation results involving regularized constrained Stackelberg problems
- A proximal difference-of-convex algorithm with extrapolation
- On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- The regularized feasible directions method for nonconvex optimization
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- On constrained optimization with nonconvex regularization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Normality of the maximum principle for nonconvex constrained Bolza problems
- New characterizations of exact regularization of non-convex programs
- Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
- scientific article; zbMATH DE number 4062841 (Why is no real title available?)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning
- scientific article; zbMATH DE number 7594592 (Why is no real title available?)
- scientific article; zbMATH DE number 7626760 (Why is no real title available?)
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- Computation of second-order directional stationary points for group sparse optimization
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Smoothing neural network for L₀ regularized optimization problem with general convex constraints
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
This page was built for publication: Optimality and complexity for constrained optimization problems with nonconvex regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595956)
