Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"gauge duality"”.

  1. Gauge duality and low-rank spectral optimization

    … problems and its connection with a theoretical duality framework for gauge functions introduced in a seminal paper by Freund (1987). Through this connection, we formulate a related eigenvalue optimization problem more amenable to the design of specialized algorithms that scale well and can be …

    ubc Repository record for Gauge duality and low-rank spectral optimization (opens in a new tab) Download PDF for Gauge duality and low-rank spectral optimization (opens in a new tab)

  2. Geometry and algorithms for signal recovery: from convex duality to non-convex formulations

    … we generalize and strengthen the theory of gauge duality in convex optimization. This includes developing a perturbation framework for gauge duality, establishing optimality conditions, and generalizing the gauge results to all nonnegative and convex functions. Second, we investigate a …

    washington Repository record for Geometry and algorithms for signal recovery: from convex duality to non-convex formulations (opens in a new tab)

  3. Bundle-type methods for dual atomic pursuit

    … of the convex hull of the atomic set and the gauges induced by the convex hull of the atomic sets have been shown to promote atomic sparsity. Examples include well-studied cases such as one norm promoting general sparsity and nuclear norm promoting low rankness. In this thesis, we examine the …

    ubc Repository record for Bundle-type methods for dual atomic pursuit (opens in a new tab) Download PDF for Bundle-type methods for dual atomic pursuit (opens in a new tab)

  4. A Primal-Dual Framework for Approximation Algorithms using Semidefinite Programming

    Duality lies in the foundation of mathematical optimization. Within combinatorial optimization, linear programming (LP) duality crucially allows for polynomial-sized proofs of optimality, guiding the design of several algorithms. This work exploits a set of alternative formulations of convex …

    waterloo Repository record for A Primal-Dual Framework for Approximation Algorithms using Semidefinite Programming (opens in a new tab)