An inexact projected regularized Newton method for fused zero-norms regularization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A Combinatorial Problem Connected with Differential Equations
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- A calculus of prox-regularity
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- A unified approach to error bounds for structured convex optimization problems
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Convergence rates of forward-Douglas-Rachford splitting method
- Convex Analysis
- Exact spike train inference via \(\ell_{0}\) optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Geometric categories and o-minimal structures
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative thresholding for sparse approximations
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Newton acceleration on manifolds identified by proximal gradient methods
- Newton method for \(\ell_0\)-regularized optimization
- Nonlinear total variation based noise removal algorithms
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On optimal multiple changepoint algorithms for large data
- On the Identification of Active Constraints
- Optimal detection of changepoints with a linear computational cost
- Pathwise coordinate optimization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal Newton-type methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Robust inversion, dimensionality reduction, and randomized sampling
- Simultaneous feature selection and clustering based on square root optimization
- Solving High-Order Portfolios via Successive Convex Approximation Algorithms
- Some continuity properties of polyhedral multifunctions
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Reconstruction by Separable Approximation
- Sparsity and Smoothness Via the Fused Lasso
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- The L^1-Potts functional for robust jump-sparse reconstruction
This page was built for publication: An inexact projected regularized Newton method for fused zero-norms regularization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7029034)
