scientific article; zbMATH DE number 7694530
From MaRDI portal
Publication:6155223
zbMath1524.90259MaRDI QIDQ6155223
Publication date: 12 June 2023
Full work available at URL: http://121.43.60.238/sxwlxbA/EN/abstract/abstract16709.shtml
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global convergenceCW optimality conditiondual sparse constrained optimization problemsgreedy simplex algorithm
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Cites Work
- The sparse principal component analysis problem: optimality conditions and algorithms
- Algorithm for cardinality-constrained quadratic optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Optimization problems involving group sparsity terms
- Optimality conditions for sparse nonlinear programming
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
- Machine learning: Trends, perspectives, and prospects
- Stable modification of explicitLU factors for simplex updates
- The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem
This page was built for publication:
