The complexity results of the sparse optimization problems and reverse convex optimization problems

DOI10.1007/S11590-020-01541-YMaRDI QIDQ2228394zbMATH OpenOpenAlexFDO

Authors Zhongyi Jiang, Qiying Hu

Publication date 17 February 2021

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-020-01541-y

zbMATH Keywords

complexitysparse solutionsparsity constraintstrongly NP-hardreverse convex

Mathematics Subject Classification ID

Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximation hardness for a class of sparse optimization problems
• Complexity results for some global optimization problems
• Reverse convex problems: an approach based on optimality conditions
• Complexity of unconstrained \(L_2 - L_p\) minimization
• A note on the complexity of \(L _{p }\) minimization

Cites work

• scientific article; zbMATH DE number 3700517 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1906319 (Why is no real title available?)
• scientific article; zbMATH DE number 837298 (Why is no real title available?)
• A cutting plane algorithm for linear reverse convex programs
• A level set algorithm for a class of reverse convex programs
• A note on the complexity of \(L _{p }\) minimization
• Characterization of local solutions for a class of nonconvex programs
• Complexity of unconstrained \(L_2 - L_p\) minimization
• Computational experience using an edge search algorithm for linear reverse convex programs
• Computational study of a family of mixed-integer quadratic programming problems
• Convex programs with an additional reverse convex constraint
• Exact and approximate sparse solutions of underdetermined linear equations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Global optimization and multi knapsack: a percolation algorithm.
• Global optimization for special reverse convex programming
• Heuristic algorithms for the cardinality constrained efficient frontier
• Heuristics for cardinality constrained portfolio optimization
• Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
• Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
• Nonlinear optimization.
• Optimal cardinality constrained portfolio selection
• Reweighted _1-minimization for sparse solutions to underdetermined linear systems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse Approximate Solutions to Linear Systems
• Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
• Stable signal recovery from incomplete and inaccurate measurements
• The Price of Robustness

Cited in

(4)

• Necessary and sufficient optimality conditions for reverse quasiconvex programs
• On the hardness of the L₁-L₂ regularization problem
• Approximation hardness for a class of sparse optimization problems
• Hyper-sparsity in the revised simplex method and how to exploit it

This page was built for publication: The complexity results of the sparse optimization problems and reverse convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228394)