Convergent inexact penalty decomposition methods for cardinality-constrained problems
type: Item
instance of: scholarly article
title: Convergent inexact penalty decomposition methods for cardinality-constrained problems
zbMATH Open document ID: 1470.90094
author: Matteo Lapucci
author: Tommaso Levato
author: Marco Sciandrone
published in: Journal of Optimization Theory and Applications
publication date: 2021-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7359119
zbMATH Keywords: cardinality constraint
zbMATH Keywords: penalty decomposition method
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: global convergence
zbMATH Keywords: derivative-free optimization
describes a project that uses: glasso
describes a project that uses: ElemStatLearn
describes a project that uses: DFN
describes a project that uses: UCI-ml
describes a project that uses: SDBOX
describes a project that uses: SciPy
describes a project that uses: DFL
describes a project that uses: TESTGO
describes a project that uses: DFBOX_IMPR
describes a project that uses: DIRMIN
describes a project that uses: Python
MaRDI profile type: Publication
full work available at URL: s10957-020-01793-9
OpenAlex ID: W3112057963
cites work: Iterative hard thresholding for compressed sensing
cites work: Compressed sensing
cites work: Best subset selection via a modern optimization lens
cites work: An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
cites work: Mixed integer second-order cone programming formulations for variable selection in linear regression
cites work: Feature subset selection for logistic regression via mixed integer optimization
cites work: Sparse inverse covariance estimation with the graphical lasso
cites work: A penalty PALM method for sparse portfolio selection problems
cites work: Computational study of a family of mixed-integer quadratic programming problems
cites work: Sparse Approximate Solutions to Linear Systems
cites work: Q4864293
cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
cites work: Sparsity constrained nonlinear optimization: optimality conditions and algorithms
cites work: Sparse Approximation via Penalty Decomposition Methods
cites work: Q4001523
cites work: On the Convergence of Block Coordinate Descent Type Methods
cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
cites work: Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
cites work: A derivative-free algorithm for bound constrained optimization
cites work: 10.1162/153244303322753751
cites work: Optimization with sparsity-inducing penalties
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.1007/S10957-020-01793-9
Recommended article: Convergence analysis of penalty decomposition algorithm for cardinality constrained convex optimization in Hilbert spaces
Recommended article: Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
Recommended article: A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
Recommended article: Exact penalties for decomposable convex optimization problems
Recommended article: Inexact penalty decomposition methods for optimization problems with geometric constraints
Recommended article: Q3319322
Recommended article: Convergence properties of a class of exact penalty methods for semi-infinite optimization problems
Recommended article: Penalty-proximal methods in convex programming
Recommended article: Q4729626
Recommended article: Convergence of a class of penalty methods for constrained scalar set-valued optimization
description: scientific article; zbMATH DE number 7359119