Penalty Methods for a Class of Non-Lipschitz Optimization Problems
From MaRDI portal
Publication:5741071
DOI10.1137/15M1028054zbMath1342.90181arXiv1409.2558OpenAlexW2963906098WikidataQ57511169 ScholiaQ57511169MaRDI QIDQ5741071
Zhaosong Lu, Xiaojun Chen, Ting Kei Pong
Publication date: 21 July 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.2558
nonconvex optimizationexact penaltysparse solutionproximal gradient methodnon-Lipschitz optimization
Related Items
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization, Further properties of the forward-backward envelope with applications to difference-of-convex programming, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, Linearly Constrained Nonsmooth Optimization for Training Autoencoders, An augmented Lagrangian method for optimization problems with structured geometric constraints, Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints, Iteratively reweighted \(\ell _1\) algorithms with extrapolation, Solution sets of three sparse optimization problems for multivariate regression, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems, An exact penalty approach for optimization with nonnegative orthogonality constraints, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, On optimal solutions of the constrained ℓ 0 regularization and its penalty problem, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, A proximal difference-of-convex algorithm with extrapolation, Equivalent Lipschitz surrogates for zero-norm and rank optimization problems, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, An efficient algorithm for joint feature screening in ultrahigh-dimensional Cox's model, A residual-based algorithm for solving a class of structured nonsmooth optimization problems, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, Generalized Penalty and Regularization Method for Differential Variational-Hemivariational Inequalities, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, Sparse Solutions of a Class of Constrained Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Exact penalty and error bounds in DC programming
- Robust least square semidefinite programming with applications
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Smoothing methods for nonsmooth, nonconvex minimization
- Asymptotics for Lasso-type estimators.
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Exact Regularization of Convex Programs
- Probing the Pareto Frontier for Basis Pursuit Solutions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Extension of Hoffman’s Error Bound to Polynomial Systems
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Reconstruction by Separable Approximation
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Comments on «Wavelets in statistics: A review» by A. Antoniadis
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
