Next Article in Journal
Counter-Terrorism Video Analysis Using Hash-Based Algorithms
Previous Article in Journal
Real-Time Arm Gesture Recognition Using 3D Skeleton Joint Data
Open AccessArticle

An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions

1
Istituto di Informatica e Telematica (IIT–CNR), Via G. Moruzzi 1, 56124 Pisa, Italy
2
Dipartimento di Matematica, University of Parma, Parco Area delle Scienze 53/A, 43124 Parma, Italy
3
Dipartimento di Informatica, University of Pisa, Largo Pontecorvo 3, 56127 Pisa, Italy
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(5), 109; https://doi.org/10.3390/a12050109
Received: 15 April 2019 / Revised: 16 May 2019 / Accepted: 20 May 2019 / Published: 23 May 2019
  |  
PDF [438 KB, uploaded 23 May 2019]
  |  

Abstract

The paper deals with the problem of global minimization of a polynomial function expressed through the Frobenius norm of two-dimensional or three-dimensional matrices. An adaptive procedure is proposed which applies a Multistart algorithm according to a heuristic approach. The basic step of the procedure consists of splitting the runs of different initial points in segments of fixed length and to interlace the processing order of the various segments, discarding those which appear less promising. A priority queue is suggested to implement this strategy. Various parameters contribute to the handling of the queue, whose length shrinks during the computation, allowing a considerable saving of the computational time with respect to classical procedures. To verify the validity of the approach, a large experimentation has been performed on both nonnegatively constrained and unconstrained problems. View Full-Text
Keywords: global minimization; polynomial function; adaptive strategy global minimization; polynomial function; adaptive strategy
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Favati, P.; Lotti, G.; Menchi, O.; Romani, F. An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions. Algorithms 2019, 12, 109.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top