---
title: Hamiltonian Convexity & Extended Lifting
url: https://www.emergentmind.com/topics/hamiltonian-convexity
type: topic
---

# Hamiltonian Convexity & Extended Lifting

Extended Convex Lifting (ECL) is a general framework for representing complex convex or nonconvex sets and optimization problems as projections of simpler (often higher-dimensional) convex sets, thereby revealing latent convexity. ECL is rooted in the study of cone factorizations, operator theory, and optimization, and applies across convex geometry, combinatorial optimization, variational methods, mixed-integer optimization, and modern robust control.

## 1. Core Definitions and Factorization Theorems

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

The central result is the **factorization theorem**:
- $C$ admits a proper $K$-lift if and only if its slack operator $S_C$ admits a $K$-factorization: there exist $A:\mathrm{ext}(C)\to K$ and $B:\mathrm{ext}(C^\circ)\to K^*$ such that $S_C(x,y) = 1-\langle x, y\rangle = \langle A(x), B(y)\rangle$.
- Conversely, any $K$-factorization induces a (possibly improper) $K$-lift [1111.3164, 1803.08079, 2002.09788].

**Cone rank** is defined for a family of cones $(K_i)$, closed under faces: for a convex body $C$, its cone rank is the minimal $i$ so that $S_C$ admits a $K_i$-factorization.

When $K = \mathbb{R}_+^k$, $k$ is the **nonnegative rank**, and for $K = S^k_+$ (the cone of $k\times k$ positive semidefinite matrices), the **psd-rank**.

## 2. Polyhedral and Spectrahedral Lifts: Complexity, Examples, and Rank

**Polyhedral lifts** ($K=\mathbb{R}_+^k$) and **spectrahedral (psd) lifts** ($K = S_+^k$) correspond to representing $C$ as the projection of a polyhedron or spectrahedron, respectively:
- Nonnegative rank governs the minimal size of a polyhedral lift for polytopes (Yannakakis theorem).
- Psd-rank governs the minimal size of a spectrahedral lift [1111.3164, 1803.08079, 2002.09788].

**Key examples:**
- Cross-polytope: $C_n = \{x:\sum_i |x_i|\le 1\}$ has a size-$2n$ polyhedral lift, exponentially smaller than the native $2^n$-facet description [1111.3164, 2002.09788].
- Elliptope: Set of correlation matrices can be lifted to a spectrahedron of polynomial size [2002.09788].
- Stable set polytopes for perfect graphs admit psd-lifts of size $n+1$ via Lovász’s theta-body [1111.3164].

The minimal lift size is lower-bounded by algebraic and combinatorial properties: e.g., a full-dimensional polytope in $\mathbb{R}^n$ has psd-rank at least $n+1$ [1803.08079, 2002.09788].

## 3. ECL in Optimization and Variational Problems

ECL facilitates the reformulation of nonconvex, non-smooth, or high-dimensional problems as convex programs:

- **Convex Optimization via Epigraph Lifting:** The epigraph of a convex $f:\mathbb{R}^n\to\mathbb{R}$, $C_f = \{(w,y): y\ge f(w)\}$, is convex. Lifting the unconstrained minimization of $f$ to a feasibility problem in $\mathbb{R}^{n+1}$ enables solution by projections onto convex sets, providing a globally convergent algorithm for a wide class of $f$ [1306.2516].

- **Infinite-dimensional and PDE Lifting:** In the Calderón problem, ECL replaces a nonlinear map $q\mapsto\Lambda_q$ by a linear map $\Phi(F) = m$ on rank-one operators $F_i = u_i \otimes q$ in Bochner or Hilbert–Schmidt operator space, and nuclear norm relaxation yields convex recovery guarantees under a dual certificate (non-degenerate source condition) [2507.00645].

- **Variational Problems on Manifolds:** For manifold-valued variational problems, ECL lifts $u:\Omega\to M$ to $v:\Omega \to \mathcal{P}(M)$ (space of probability measures), bringing the problem into the realm of convex-concave saddle-point optimization, and generalizing sublabel-accurate approaches [1908.03776, 1905.00851].

## 4. ECL in Mixed-Integer, Disjunctive, and Quadratic Programs

ECL underpins the systematic derivation of strong convex hull descriptions in nonconvex or discrete settings:
- **Mixed-Integer Lifting:** Minimal valid inequalities for mixed-integer linear programs are lifted by constructing cuts in augmented spaces, using gauge functions of maximal $S$-free sets and their convex extensions, yielding order-independent minimal coefficients [1701.06628].
- **Disjunctive Programming:** For the convex hull of $n+1$ polytopes in $\mathbb{R}^d$, full optimal big-$M$ lifting suffices for $d\le 2$ or with common-constraint structure; for $d\ge 3$, extra rounds (e.g., MIR cuts) may be necessary [2407.15244].
- **Bipartite Bilinear Sets:** Sequential and subadditive (two-slope) liftings derive second-order cone representable (SOC) constraints for QCQPs, unifying and generalizing lifting approaches for strong convex relaxations [2106.12625].

## 5. Applications in Control, RL, and Hidden Convexity

Modern control theory has leveraged ECL to reconcile nonconvex policy-search with classical LMI-based design:
- **LQR, LQG, $H_\infty$ Control:** Despite nonconvexity in the controller space, ECL provides diffeomorphic parameterizations onto convex sets defined by Riccati or LMI certificates. Under standard nondegeneracy, every stationary point is globally optimal, and convex SDPs certify strong duality and gradient dominance [2312.15332, 2406.04001, 2503.10964, 2603.04843].
- **Mixed $H_2/H_\infty$ Control:** ECL yields scalable policy-update schemes, convexifies the Riccati/Lyapunov inequality constraints, and underlies the benign landscape of stationary points [2603.04843].
- **Distributed Control under QI:** ECL gives convexification in cases with quadratic invariance (QI) by mapping policies to Youla parameters, enabling convex analysis of structured control synthesis [2406.04001].

## 6. Obstructions and Limitations: When Small Lifts Fail

In some situations, obstructions preclude the existence of small polyhedral or spectrahedral lifts:
- **Facial Structure:** Count of faces, chain-length, and neighborliness in the face poset can forbid small lifts; e.g., the number of Boolean lattice faces puts lower bounds on nonnegative rank [2002.09788].
- **Algebraic Degree:** The degree of the algebraic boundary of $C$ controls the minimal LMI size: e.g., for $k$-ellipse or high-degree semialgebraic sets, no spectrahedral lift of polynomial size exists [2002.09788, 1803.08079].
- **Symmetry:** Symmetric lifts can require much higher dimension than (possibly non-symmetric) unconstrained lifts [1111.3164].

## 7. Extensions, Open Problems, and Future Directions

ECL continues to be a focal point for advances at the intersection of convex optimization, real algebraic geometry, combinatorial optimization, and control:
- Open questions include exact characterization of families with small psd-lifts, the role of symmetry, computational complexity of deciding cone rank and lift size, and further generalizations to nonlinear, hybrid, or purely data-driven settings [1803.08079, 1111.3164, 2002.09788, 2406.04001].
- The ECL perspective unifies mixed-integer, variational, and control-theoretic techniques, provides algorithmic tools for face enumeration (fixed-d polyhedra), and motivates convex relaxation strategies via operator and cone factorization.

In summary, Extended Convex Lifting is a foundational geometric and algebraic strategy for uncovering and exploiting hidden convexity in a range of problems, with broad implications for optimization complexity, algorithmic design, and theoretical understanding [1111.3164, 1803.08079, 2002.09788, 2312.15332, 2406.04001, 2507.00645].

Source: https://www.emergentmind.com/topics/hamiltonian-convexity