---
title: Extended Convex Lifting
url: https://www.emergentmind.com/topics/extended-convex-lifting-ecl
type: topic
---

# Extended Convex Lifting

Extended Convex Lifting (ECL) is the mathematical framework characterizing when a convex set, function, or optimization problem admits a representation as the projection of a higher-dimensional "simpler" convex set, often enabling reformulation of nonconvex or intractable problems as tractable convex programs. At its core is the equivalence between such liftings and conic (or operator) factorizations of objects derived from the problem data, such as slack operators or observables. ECL plays a central role in convex geometry, convex algebraic geometry, optimization, combinatorial optimization, control, statistics, inverse problems, and variational analysis.

## 1. Foundational Principles and Theorem

Let \( C \subset \mathbb{R}^n \) be a full-dimensional convex body and \( K \subset \mathbb{R}^m \) a full-dimensional closed convex cone. A **K-lift** of \( C \) is data \((L, \pi)\) where \( L \subset \mathbb{R}^m \) is affine and \( \pi: \mathbb{R}^m \to \mathbb{R}^n \) is linear such that \( C = \pi(K \cap L) \); the lift is **proper** if \( L \cap \operatorname{int} K \neq \emptyset \) [1111.3164].

The central result (generalized Yannakakis–Gouveia–Parrilo–Thomas Theorem) states:

- \( C \) admits a proper \( K \)-lift **if and only if** its **slack operator** \( S_C \) admits a K-factorization:
  - There exist maps \( A: \operatorname{ext}(C) \to K \), \( B: \operatorname{ext}(C^\circ) \to K^* \) such that
    \[
    S_C(x, y) = 1 - \langle x, y \rangle = \langle A(x), B(y) \rangle
    \]
    for all \( x \) extreme in \( C \), \( y \) extreme in the polar \( C^\circ \).

Conversely, existence of such a factorization gives a (not necessarily proper) K-lift [1111.3164, 1803.08079, 2002.09788].

For polytopes, this reduces to nonnegative factorization of the slack matrix and recovers Yannakakis’s equivalence of polyhedral lifts and nonnegative rank.

## 2. Cone Factorizations, psd-rank, and Lifting Complexity

Given a sequence of cones \( (K_i)_{i \in \mathbb{N}} \) closed under faces, one defines **cone rank** (or, for spectrahedral lifts, the **psd-rank**). For a nonnegative matrix \( M \), the psd-rank is the minimal \( k \) such that there exist \( A_i, B_j \succeq 0 \) in \( \mathcal{S}_+^k \) with \( M_{ij} = \langle A_i, B_j \rangle \) [1111.3164, 1803.08079].

Key bounds:
- \( \mathrm{rank}(M) \leq \mathrm{psd}\text{-}\mathrm{rank}(M) \leq \mathrm{nonneg}\text{-}\mathrm{rank}(M) \leq \min\{\# \mathrm{rows}, \# \mathrm{cols}\} \).
- For polytopes, \( \mathrm{psd}\text{-}\mathrm{rank}(P) \geq \dim P + 1 \); for general convex sets, further lower bounds involve algebraic degree and combinatorial structure [2002.09788].

This formalism enables a complexity theory of lifts: sets requiring large nonnegative or psd-rank cannot admit small polyhedral or semidefinite lifts [1803.08079, 2002.09788].

## 3. Methodology: Explicit Constructions and Examples

ECL provides both existence results and constructive tools for lifts:

- **Polyhedral lifts:** For \( C_n = \{x : \sum |x_i| \leq 1\} \), one constructs a \( \mathbb{R}_+^{3n+1} \)-lift as
  \[
  \left\{(x, y) : \sum y_i = 1,\, -y_i \leq x_i \leq y_i,\, y_i \geq 0\right\}
  \]
  whose projection onto \( x \) recovers \( C_n \) [1111.3164, 2002.09788].

- **Spectrahedral lifts (psd-lifts):** For the unit disk \( D \subset \mathbb{R}^2 \), the slack operator is factorized using
  \[
  A(x) = \begin{bmatrix} 1 + x & y \\ y & 1 - x \end{bmatrix},\
  B(x) = \frac{1}{2} \begin{bmatrix} 1 - x & -y \\ -y & 1 + x \end{bmatrix}
  \]
  [1111.3164, 1803.08079]. For the Lovász theta body,
  \[
  \mathrm{STAB}(G) = \operatorname{proj}_{\operatorname{diag}} \left\{X \succeq 0: X_{00} = 1, X_{ii} = X_{0i}, X_{ij} = 0\,\forall(i,j) \in E\right\}
  \]
  gives a psd-lift of size \( n+1 \) for perfect graphs [1111.3164, 2002.09788].

- **Lifting for variational and inverse problems:** ECL is extended to PDE-constrained inverse problems (e.g., the Calderón problem) by lifting bilinear terms \( q u \) to rank-one operators and relaxing to nuclear-norm regularization, producing infinite-dimensional analogues of PhaseLift with exactness characterized by source conditions [2507.00645]. In variational imaging, ECL relaxes nonconvex labeling to convex programs on probability measures via sublabel-accurate and manifold-valued liftings [1905.00851, 1908.03776].

## 4. Applications in Optimization, Control, and Statistics

- **Combinatorial optimization:** ECL underlies the theory of extended formulations, notably for the permutahedron (via the Birkhoff polytope), matching polytopes, and cut polytopes. Combinatorial and algebraic lower bounds for extension complexity follow from ECL obstructions [2002.09788].

- **Policy optimization and control:** ECL provides a geometric lens for hidden convexity in nonconvex policy search for LQR, LQG, \( \mathcal{H}_\infty \) and mixed \( H_2/H_\infty \) control. Nonconvex, bilinear, or quadratic formulations are lifted to convex LMI or semidefinite programs via change-of-variables and auxiliary variables (e.g., Lyapunov gramians). The principal result is that every non-degenerate stationary point is globally optimal, certifying the "benign landscape" property in these problems [2312.15332, 2406.04001, 2503.10964, 2603.04843].

- **Statistics and random sets:** The lift zonoid and lift expectation of a random convex body encode all one-dimensional marginals of its support function; ECL provides a convex geometric description of depth regions, stochastic orders, and statistical risk bounds [1805.04757].

- **Mixed-integer programming and disjunctive sets:** ECL unifies big-M and subadditive lifting of inequalities, with full characterization of the facet structure of lifted convex hulls in low dimension and sequence-independent lifting schemes for bipartite bilinear sets [2106.12625, 2407.15244, 1701.06628].

## 5. Theoretical Limitations and Obstructions

ECL identifies precise obstructions to the existence of compact lifts:

- **Facial structure:** The face poset of any lift \( Q \) must embed that of the original set \( C \), which restricts the possible lifting cones \( K \) (e.g., neighborliness and chain-length arguments prohibit small-size lifts) [2002.09788].

- **Algebraic degree bounds:** The degree of the algebraic boundary of \( C \) limits the minimal size of a spectrahedral lift; certain semialgebraic convex sets admit no LMI representation of any finite size (Scheiderer’s counterexamples) [1803.08079, 2002.09788].

- **Parameterization and numerical obstacles:** In infinite-dimensional and function spaces (e.g., PDEs), the existence and construction of dual certificates (source conditions) for exactness of nuclear-norm relaxations, and identifiability from finite data, can be highly nontrivial [2507.00645].

## 6. Algorithmic and Practical Aspects

ECL-based reformulations enable a range of algorithmic frameworks:

| Domain                    | ECL Construction                      | Resulting Program Type    |
|---------------------------|---------------------------------------|--------------------------|
| Polyhedral combinatorics  | Nonnegative-rank slack factorization  | Linear/LP, extended formulation |
| Semidefinite optimization | PSD-rank/slack factorization          | SDP, LMI                  |
| Quadratic inverse/PDE     | Operator-lifting + nuclear norm       | Convex (nuclear norm) minimization |
| Policy optimization       | LMI reformulation via variable change | SDP/LMI, strong duality   |
| Mixed-integer programming | Lifting valid inequalities            | Piecewise linear/SOC cuts |

ECL facilitates solution via standard LP/SDP solvers when factorization is achieved, or motivates sublabel-accurate, block-coordinate, and primal-dual methods for variational relaxations [1306.2516, 1905.00851, 2106.12625, 2603.04843].

## 7. Symmetry, Uniqueness, and Further Directions

Symmetry constrains small symmetric lifts; asymmetric (non-equivariant) factorizations may yield exponentially smaller lifts (e.g., for regular polygons) [1111.3164]. The uniqueness of lifting in minimal cut-generating functions for integer programming is characterized via covering of parameter space by finitely many polyhedral regions [1701.06628].

Open problems include determining minimal psd-rank for families of polytopes, explicit construction of small lifts for high degree/semi-algebraic sets, generalizing ECL to non-quadratic/non-affine/nonlinear settings, and understanding the quantitative limits of lifting for practical large-scale optimization [2002.09788, 2406.04001, 2507.00645].

---

**References:**
- "Lifts of convex sets and cone factorizations" [1111.3164]
- "Spectrahedral Lifts of Convex Sets" [1803.08079]
- "Lifting for Simplicity: Concise Descriptions of Convex Sets" [2002.09788]
- "Benign Nonconvex Landscapes in Optimal and Robust Control, Part II: Extended Convex Lifting" [2406.04001]
- "Policy Optimization of Mixed H2/H-infinity Control: Benign Nonconvexity and Global Optimality" [2603.04843]
- "A convex lifting approach for the Calderón problem" [2507.00645]
- "Lift expectations of random sets" [1805.04757]
- "Lifting Vectorial Variational Problems" [1905.00851]
- "Lifting methods for manifold-valued variational problems" [1908.03776]
- "Lifting convex inequalities for bipartite bilinear programs" [2106.12625]
- "Unique lifting of integer variables in minimal inequalities" [1701.06628]
- "Projections Onto Convex Sets (POCS) Based Optimization by Lifting" [1306.2516]

Source: https://www.emergentmind.com/topics/extended-convex-lifting-ecl