AN APPROACH TO CONSTRAINED POLYNOMIAL OPTIMIZATION VIA NONNEGATIVE CIRCUIT POLYNOMIALS AND GEOMETRIC PROGRAMMING - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

AN APPROACH TO CONSTRAINED POLYNOMIAL OPTIMIZATION VIA NONNEGATIVE CIRCUIT POLYNOMIALS AND GEOMETRIC PROGRAMMING

Sadik Iliman
  • Function : Author
  • PersonId : 957848

Abstract

In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third author. On the other hand, we investigate geometric programming methods for constrained polynomial optimization problems, which were recently developed by Ghasemi and Marshall. We show that the combination of both results yields a new method to solve certain classes of constrained polynomial optimization problems. We test the new method experimentally and compare it to semidefinite programming in various examples.
Fichier principal
Vignette du fichier
SONC_GP_ConstrainedOpt_MEGASpecialIssue_Vers3.pdf (727.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01829714 , version 1 (04-07-2018)

Identifiers

  • HAL Id : hal-01829714 , version 1

Cite

Mareike Dressler, Sadik Iliman, Timo de Wolff. AN APPROACH TO CONSTRAINED POLYNOMIAL OPTIMIZATION VIA NONNEGATIVE CIRCUIT POLYNOMIALS AND GEOMETRIC PROGRAMMING. MEGA 2017 - International Conference on Effective Methods in Algebraic Geometry, Jun 2017, Nice, France. ⟨hal-01829714⟩
119 View
171 Download

Share

Gmail Facebook X LinkedIn More