#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2013

2017

- This year (2)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Felix Lieder, Fatemeh Bani Asadi Rad, Florian Jarre
- Comp. Opt. and Appl.
- 2015

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)

- Shi-Yang Tang, Vijay Sivan, +8 authors Kourosh Kalantar-zadeh
- Nanoscale
- 2013

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)

- Felix Lieder
- Oper. Res. Lett.
- 2015

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)

This paper introduces a derivative-free and ready-to-use solver for nonlinear programs with nonlinear equality and inequality constraints (NLPs). Using finite differences and a sequential quadratic programming (SQP) approach, the algorithm aims at finding a local minimizer and no extra attempt is made to generate a globally optimal solution. Due to the use… (More)

- ‹
- 1
- ›