Convex optimization under combinatorial sparsity constraints

DOI10.1016/J.ORL.2022.09.004OpenAlexW4297141534MaRDI QIDQ2102824FDOQ2102824

Authors: Christoph Buchheim, Emiliano Traversi 

Publication date: 12 December 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.09.004

zbMATH Keywords

sparse regressionsparse optimizationcardinality constrained knapsack

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• CSDP, A C library for semidefinite programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Sparse Optimization with Least-Squares Constraints
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• SparseNet: coordinate descent with nonconvex penalties
• A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
• Sparse Approximate Solutions to Linear Systems
• Sparse and stable Markowitz portfolios
• A polyhedral study of the cardinality constrained knapsack problem
• Sparse high-dimensional regression: exact scalable algorithms and phase transitions
• Quadratic Combinatorial Optimization Using Separable Underestimators

Cited In (4)

• Restricted normal cones and sparsity optimization with affine constraints
• Title not available (Why is that?)
• Sparse convex optimization toolkit: a mixed-integer framework
• Tree-sparse convex programs

Uses Software

• CSDP
• CPLEX
• Ipopt
• SPGL1
• Biq Mac
• sparsenet

This page was built for publication: Convex optimization under combinatorial sparsity constraints

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