@inbook{1d31b08077d24814aaf39ec84ecf634b,
title = "From continuous to discrete",
abstract = "One approach that has been used to solve the DGP is to represent it as a continuous optimization problem [59]. To understand it, we consider a DGP with K = 2, V = \{u, v, s\}, E = \{\{ u, v\}, \{v, s\}\}, where the associated quadratic system is [Formula presented] which can be rewritten as [Formula presented] Consider the function f: ℝ6→ ℝ, defined by [Formula presented] It is not hard to realize that the solution x∗∈ ℝ6 of the associated DGP can be found by solving the following problem: [Formula presented] That is, we wish to find the point x*∈ ℝ6 which attains the smallest value of f.",
author = "Carlile Lavor and Leo Liberti and Lodwick, \{Weldon A.\} and \{Mendon{\c c}a da Costa\}, Tiago",
note = "Publisher Copyright: {\textcopyright} The Author(s) 2017.",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-57183-6\_3",
language = "English",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9783319571829",
pages = "13--20",
booktitle = "SpringerBriefs in Computer Science",
edition = "9783319571829",
}