EconPapers    
Economics at your fingertips  
 

A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set

Rudolf Scitovski ()
Additional contact information
Rudolf Scitovski: University of Osijek

Journal of Global Optimization, 2017, vol. 68, issue 4, No 2, 713-727

Abstract: Abstract In this paper, we consider a global optimization problem for a symmetric Lipschitz continuous function $$g:[a,b]^k\rightarrow {\mathbb {R}}$$ g : [ a , b ] k → R , whose domain $$[a,b]^k\subset {\mathbb {R}}^k$$ [ a , b ] k ⊂ R k consists of k! hypertetrahedrons of the same size and shape, in which function g attains equal values. A global minimum can therefore be searched for in one hypertetrahedron only, but then this becomes a global optimization problem with linear constraints. Apart from that, some known global optimization algorithms in standard form cannot be applied to solving the problem. In this paper, it is shown how this global optimization problem with linear constraints can easily be transformed into a global optimization problem on hypercube $$[0,1]^k$$ [ 0 , 1 ] k , for the solving of which an applied DIRECT algorithm in standard form is possible. This approach has a somewhat lower efficiency than known global optimization methods for symmetric Lipschitz continuous functions (such as SymDIRECT or DISIMPL), but, on the other hand, this method allows for the use of publicly available and well developed computer codes for solving a global optimization problem on hypercube $$[0,1]^k$$ [ 0 , 1 ] k (e.g. the DIRECT algorithm). The method is illustrated and tested on standard symmetric functions and very demanding center-based clustering problems for the data that have only one feature. An application to the image segmentation problem is also shown.

Keywords: Symmetric function; Lipschitz continuous function; Global optimization; DIRECT; SymDIRECT; DISIMPL; Center-based clustering; 65K05; 90C26; 90C27; 90C56; 90C57; 05E05 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-017-0510-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:68:y:2017:i:4:d:10.1007_s10898-017-0510-4

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-017-0510-4

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jglopt:v:68:y:2017:i:4:d:10.1007_s10898-017-0510-4