On solutions of sparsity constrained optimization

DOI10.1007/s40305-015-0101-3zbMath1332.90216OpenAlexW1937543970MaRDI QIDQ259112

Sheng-Long Zhou, Li-Li Pan, Nai-Hua Xiu

Publication date: 11 March 2016

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0101-3

zbMATH Keywords

normal conetangent conefirst-order optimality conditionsecond-order optimality conditionsparsity constrained optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (17)

Optimality conditions for sparse nonlinear programming ⋮ Sparsity constrained optimization problems via disjunctive programming ⋮ Gradient projection Newton pursuit for sparsity constrained optimization ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming ⋮ A greedy Newton-type method for multiple sparse constraint problem ⋮ On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach ⋮ A quadratic penalty method for hypergraph matching ⋮ A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization ⋮ Lagrangian duality and saddle points for sparse linear programming ⋮ Orbital geometry and group majorisation in optimisation ⋮ An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets ⋮ Nonsmooth sparsity constrained optimization problems: optimality conditions ⋮ A Lagrange-Newton algorithm for sparse nonlinear programming ⋮ Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function ⋮ Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications ⋮ On nondegenerate M-stationary points for sparsity constrained nonlinear optimization ⋮ The first-order necessary conditions for sparsity constrained optimization

Cites Work

• Restricted normal cones and sparsity optimization with affine constraints
• Iterative thresholding for sparse approximations
• Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
• Decoding by Linear Programming
• Projected gradient methods for linearly constrained problems
• Variational Analysis
• Sparse Approximate Solutions to Linear Systems
• Greedy Sparsity-Constrained Optimization
• Sparse Approximation via Penalty Decomposition Methods
• Compressed sensing
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

This page was built for publication: On solutions of sparsity constrained optimization