A Fine-Grained Variant of the Hierarchy of Lasserre

06/23/2019
by   Wann-Jiun Ma, et al.
0

There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP). These often converge to the global optimum of the POP, asymptotically, but prove challenging to solve beyond the first level in the hierarchy for modest instances. We present a finer-grained variant of the Lasserre hierarchy, together with first-order methods for solving the convexifications, which allow for efficient warm-starting with solutions from lower levels in the hierarchy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

More Hierarchy in Route Planning Using Edge Hierarchies

A highly successful approach to route planning in networks (particularly...
research
08/25/2021

The Next 700 Program Transformers

In this paper, we describe a hierarchy of program transformers in which ...
research
11/15/2017

Finer Grained Entity Typing with TypeNet

We consider the challenging problem of entity typing over an extremely f...
research
12/12/2007

Hierarchy construction schemes within the Scale set framework

Segmentation algorithms based on an energy minimisation framework often ...
research
07/04/2012

The DLR Hierarchy of Approximate Inference

We propose a hierarchy for approximate inference based on the Dobrushin,...
research
10/19/2022

Hierarchical classification at multiple operating points

Many classification problems consider classes that form a hierarchy. Cla...
research
02/17/2017

Hierarchy Influenced Differential Evolution: A Motor Operation Inspired Approach

Operational maturity of biological control systems have fuelled the insp...

Please sign up or login with your details

Forgot password? Click here to reset