{"id":{"repo_id":"purdue-thes","oai_identifier":"oai:docs.lib.purdue.edu:open_access_dissertations-2604"},"canonical_url":"https://search.dev.ndltd.org/etd/purdue-thes/oai:docs.lib.purdue.edu:open_access_dissertations-2604","repository":{"repo_id":"purdue-thes","name":"Purdue University","base_url":"https://docs.lib.purdue.edu/do/oai/"},"display":{"title":"Cardinality Constrained Optimization Problems","abstract":"In this thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, computational finance, and operations management. Despite their practical needs, most optimization problems with a cardinality constraints are hard to solve due to their nonconvexity. We focus on constructing tight convex relaxations to such problems.","abstract_html":"In this thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, computational finance, and operations management. Despite their practical needs, most optimization problems with a cardinality constraints are hard to solve due to their nonconvexity. We focus on constructing tight convex relaxations to such problems.","abstract_has_math":false,"creators":["Kim, Jinhak"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Management","degree_department":null,"school":null,"contributors":["Mohit Tawarmalani","Jean-Philippe P Richard","Yanjun Li","Thanh Nguyen"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-01-01T08:00:00Z","date_published":"2016-01-01T08:00:00Z","updated_at":"2026-07-24T03:54:38Z","subjects":["Cardinality constraint","Cutting planes","Sparse principal component analysis"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://docs.lib.purdue.edu/open_access_dissertations/1388","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Mohit Tawarmalani","Jean-Philippe P Richard","Yanjun Li","Thanh Nguyen"]},{"key":"dc:creator","label":"Author","values":["Kim, Jinhak"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Management"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Cardinality constraint","Cutting planes","Sparse principal component analysis"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://docs.lib.purdue.edu/open_access_dissertations/1388"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, computational finance, and operations management. Despite their practical needs, most optimization problems with a cardinality constraints are hard to solve due to their nonconvexity. We focus on constructing tight convex relaxations to such problems."]},{"key":"dc:title","label":"Title","values":["Cardinality Constrained Optimization Problems"]}]}],"canonical_facts":{"dc:contributor":["Mohit Tawarmalani","Jean-Philippe P Richard","Yanjun Li","Thanh Nguyen"],"dc:creator":["Kim, Jinhak"],"dc:description.abstract":["In this thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, computational finance, and operations management. Despite their practical needs, most optimization problems with a cardinality constraints are hard to solve due to their nonconvexity. We focus on constructing tight convex relaxations to such problems."],"dc:identifier":["https://docs.lib.purdue.edu/open_access_dissertations/1388"],"dc:subject":["Cardinality constraint","Cutting planes","Sparse principal component analysis"],"dc:title":["Cardinality Constrained Optimization Problems"],"thesis:degree_discipline":["Management"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-07-24T03:54:38Z"}