Pages that link to "Item:Q2436652"
From MaRDI portal
The following pages link to Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652):
Displaying 50 items.
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Sparse solutions of linear complementarity problems (Q312696) (← links)
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone (Q476270) (← links)
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
- The sparsest solutions to \(Z\)-tensor complementarity problems (Q519760) (← links)
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization (Q1631426) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- A joint matrix minimization approach for multi-image face recognition (Q1656900) (← links)
- Global convergence of proximal iteratively reweighted algorithm (Q1675580) (← links)
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming (Q1682972) (← links)
- An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization (Q1996752) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images (Q2060052) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration (Q2095175) (← links)
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (Q2135875) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction (Q2179318) (← links)
- The complexity results of the sparse optimization problems and reverse convex optimization problems (Q2228394) (← links)
- A gradient descent based algorithm for \(\ell_p\) minimization (Q2286916) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (Q2330643) (← links)
- Rank-one and sparse matrix decomposition for dynamic MRI (Q2353466) (← links)
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems (Q2364127) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities (Q2415905) (← links)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
- A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing (Q2691208) (← links)
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
- A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization (Q3196655) (← links)
- A smoothing majorization method for matrix minimization (Q3458812) (← links)
- (Q4558147) (← links)
- (Q4633050) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere (Q4689765) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere (Q5018371) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- (Q5053267) (← links)
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
