Pages that link to "Item:Q5408227"

The following pages link to Sparse Approximation via Penalty Decomposition Methods (Q5408227):

Displaying 50 items.

• On solutions of sparsity constrained optimization (Q259112) (← links)
• The first-order necessary conditions for sparsity constrained optimization (Q259127) (← links)
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
• A quadratic penalty method for hypergraph matching (Q683734) (← links)
• The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
• Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
• Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming (Q1682972) (← links)
• Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
• Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization (Q1996752) (← links)
• Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
• Efficient regularized regression with \(L_0\) penalty for variable selection and network construction (Q2011726) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
• Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case (Q2040452) (← links)
• An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
• Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
• A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
• On nondegenerate M-stationary points for sparsity constrained nonlinear optimization (Q2114575) (← links)
• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
• Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems (Q2163465) (← links)
• A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
• A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization (Q2245040) (← links)
• A penalty decomposition method for rank minimization problem with affine constraints (Q2282364) (← links)
• An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• Nonsmooth sparsity constrained optimization problems: optimality conditions (Q2311196) (← links)
• Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
• Optimality conditions for sparse nonlinear programming (Q2361004) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
• Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms (Q2800370) (← links)
• An efficient optimization approach for a cardinality-constrained index tracking problem (Q2815504) (← links)
• Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables (Q2829575) (← links)
• Proximal Mapping for Symmetric Penalty and Sparsity (Q4606656) (← links)
• Selection and Fusion of Categorical Predictors with L0-Type Penalties (Q4971423) (← links)
• Sparse inverse covariance matrix estimation via the $ \newcommand{\e}{{\rm e}} \ell_{0}$ -norm with Tikhonov regularization (Q4973542) (← links)