Felix Lieder

Learn More
A reformulation of quadratically constrained binary programs as duals of set-copositive linear optimization problems is derived using either {0, 1}-formulations or {1, 1}-formulations. The latter representation allows an extension of the randomization technique by Goemans and Williamson. An application to the max-clique problem shows that the max-clique(More)
Controlled actuation of soft objects with functional surfaces in aqueous environments presents opportunities for liquid phase electronics, novel assembled super-structures and unusual mechanical properties. We show the extraordinary electrochemically induced actuation of liquid metal droplets coated with nanoparticles, so-called "liquid metal marbles". We(More)
This paper is concerned with completely positive and semidefinite relaxations of quadratic programs with linear constraints and binary variables as presented in Burer [2]. It observes that all constraints of the relaxation associated with linear constraints of the original problem can be accumulated in a single linear constraint without changing the(More)
This paper explores the existence of affine invariant descent directions for unconstrained minimization. While there may exist several affine invariant descent directions for smooth functions f at a given point, it is shown that for quadratic functions there exists exactly one invariant descent direction in the strictly convex case and generally none in the(More)
  • 1