On The Projection Operator to A Three-view Cardinality Constrained Set

03/21/2017
by   Haichuan Yang, et al.
0

The cardinality constraint is an intrinsic way to restrict the solution structure in many domains, for example, sparse learning, feature selection, and compressed sensing. To solve a cardinality constrained problem, the key challenge is to solve the projection onto the cardinality constraint set, which is NP-hard in general when there exist multiple overlapped cardinality constraints. In this paper, we consider the scenario where the overlapped cardinality constraints satisfy a Three-view Cardinality Structure (TVCS), which reflects the natural restriction in many applications, such as identification of gene regulatory networks and task-worker assignment problem. We cast the projection into a linear programming, and show that for TVCS, the vertex solution of this linear programming is the solution for the original projection problem. We further prove that such solution can be found with the complexity proportional to the number of variables and constraints. We finally use synthetic experiments and two interesting applications in bioinformatics and crowdsourcing to validate the proposed TVCS model and method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/08/2011

On Minimal Constraint Networks

In a minimal binary constraint network, every tuple of a constraint rela...
research
03/26/2021

Synthesizing Linked Data Under Cardinality and Integrity Constraints

The generation of synthetic data is useful in multiple aspects, from tes...
research
06/29/2011

A Comparison of Lex Bounds for Multiset Variables in Constraint Programming

Set and multiset variables in constraint programming have typically been...
research
02/10/2021

Integrating Cardinality Constraints into Constraint Logic Programming with Sets

Formal reasoning about finite sets and cardinality is an important tool ...
research
02/07/2023

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities

We study an extension of the cardinality-constrained knapsack problem wh...
research
11/10/2022

Metaheuristic Approach to Solve Portfolio Selection Problem

In this paper, a heuristic method based on TabuSearch and TokenRing Sear...
research
02/10/2021

Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices

Finding the largest cardinality feasible subset of an infeasible set of ...

Please sign up or login with your details

Forgot password? Click here to reset