On the Exactness of Dantzig-Wolfe Relaxation for Rank Constrained Optimization Problems

10/28/2022
by   Yongchun Li, et al.
0

This paper studies the rank constrained optimization problem (RCOP) that aims to minimize a linear objective function over intersecting a prespecified closed rank constrained domain set with m two-sided linear constraints. Replacing the domain set by its closed convex hull offers us a convex Dantzig-Wolfe Relaxation (DWR) of the RCOP. Our goal is to characterize necessary and sufficient conditions under which the DWR and RCOP are equivalent in the sense of extreme point, convex hull, and objective value. More precisely, we develop the first-known necessary and sufficient conditions about when the DWR feasible set matches that of RCOP for any m linear constraints from two perspectives: (i) extreme point exactness – all extreme points in the DWR feasible set belong to that of the RCOP; and (ii) convex hull exactness – the DWR feasible set is identical to the closed convex hull of RCOP feasible set. From the optimization view, we also investigate (iii) objective exactness – the optimal values of the DWR and RCOP coincide for any m linear constraints and a family of linear objective functions. We derive the first-known necessary and sufficient conditions of objective exactness when the DWR admits four favorable classes of linear objective functions, respectively. From the primal perspective, this paper presents how our proposed conditions refine and extend the existing exactness results in the quadratically constrained quadratic program (QCQP) and fair unsupervised learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2023

On the Partial Convexification for Low-Rank Spectral Optimization: Rank Bounds and Algorithms

A Low-rank Spectral Optimization Problem (LSOP) minimizes a linear objec...
research
07/09/2009

Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes

We show how the necessary and sufficient conditions for the NFL to apply...
research
10/24/2014

On the Complexity of Optimization Problems based on Compiled NNF Representations

Optimization is a key task in a number of applications. When the set of ...
research
11/05/2019

Approximate Uncertain Program

Chance constrained program where one seeks to minimize an objective over...
research
10/17/2017

Combinatorial Penalties: Which structures are preserved by convex relaxations?

We consider the homogeneous and the non-homogeneous convex relaxations f...
research
08/07/2022

Parabolic Relaxation for Quadratically-constrained Quadratic Programming – Part I: Definitions Basic Properties

For general quadratically-constrained quadratic programming (QCQP), we p...
research
09/17/2018

On Minimal Copulas under the Concordance Orde

In the present paper, we study extreme negative dependence focussing on ...

Please sign up or login with your details

Forgot password? Click here to reset