Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization

DOI10.1287/moor.2016.0837zbMath1386.90167OpenAlexW2606421266MaRDI QIDQ4595956

Wei Bian, Xiaojun Chen

Publication date: 7 December 2017

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5c8f102f39dbb7045b19578520f500dc53f78444

zbMATH Keywords

optimality conditiongeneralized directional derivativenumerical propertyconstrained nonsmooth nonconvex optimizationdirectional derivative consistency

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for minimax problems (49K35)

Related Items (18)

An interior stochastic gradient method for a class of non-Lipschitz optimization problems ⋮ 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_0\) regularized optimization problem with general convex constraints ⋮ Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem ⋮ Unnamed Item ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ Unnamed Item ⋮ On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ Computation of second-order directional stationary points for group sparse optimization ⋮ Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods ⋮ 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 ⋮ Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ Bilevel Optimization of Regularization Hyperparameters in Machine Learning ⋮ Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems

This page was built for publication: Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization