Pages that link to "Item:Q2903300"

The following pages link to Optimization with sparsity-inducing penalties (Q2903300):

Displaying 50 items.

• Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization (Q4986410) (← links)
• A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
• Sparsity-promoting algorithms for the discovery of informative Koopman-invariant subspaces (Q4987934) (← links)
• Convergence of proximal gradient algorithm in the presence of adjoint mismatch ^* (Q4995169) (← links)
• On the Effectiveness of Richardson Extrapolation in Data Science (Q5018900) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
• (Q5053252) (← links)
• (Q5054606) (← links)
• Global optimization for sparse solution of least squares problems (Q5058393) (← links)
• A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
• Parameter choices for sparse regularization with the ℓ1 norm ^* (Q5060748) (← links)
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
• Multivariate Monotone Inclusions in Saddle Form (Q5085132) (← links)
• (Q5148934) (← links)
• (Q5149020) (← links)
• (Q5159426) (← links)
• The Signature Kernel Is the Solution of a Goursat PDE (Q5162619) (← links)
• (Q5173885) (← links)
• (Q5214207) (← links)
• A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm (Q5220423) (← links)
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (Q5244401) (← links)
• (Q5251797) (← links)
• Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning (Q5254990) (← links)
• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
• Sparse Approximation via Penalty Decomposition Methods (Q5408227) (← links)
• (Q5452936) (← links)
• Convex Optimization and Parsimony of $L_p$-balls Representation (Q5743611) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• Safe Rules for the Identification of Zeros in the Solutions of the SLOPE Problem (Q5885837) (← links)
• On Algorithms for Difference of Monotone Operators (Q5896074) (← links)
• On Algorithms for Difference of Monotone Operators (Q5896140) (← links)
• Structured sparsity through convex optimization (Q5965303) (← links)
• Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) (← links)
• Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions (Q6069861) (← links)
• A computational framework for edge-preserving regularization in dynamic inverse problems (Q6076066) (← links)
• A unifying framework for sparsity-constrained optimization (Q6086139) (← links)
• Root-finding approaches for computing conformal prediction set (Q6097145) (← links)
• Smooth over-parameterized solvers for non-smooth structured optimization (Q6110460) (← links)
• Optimal analysis of method with batching for monotone stochastic finite-sum variational inequalities (Q6124397) (← links)
• Global optimization using random embeddings (Q6160282) (← links)
• High-dimensional composite quantile regression: optimal statistical guarantees and fast algorithms (Q6184871) (← links)
• Optimization with Sparsity-Inducing Penalties (Q6226908) (← links)
• Variable screening for Lasso based on multidimensional indexing (Q6535782) (← links)
• On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties (Q6559515) (← links)
• A generalized formulation for group selection via ADMM (Q6571367) (← links)
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion (Q6581202) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization (Q6585819) (← links)