All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The Nelder-Mead simplex method with variables partitioning for solving large scale optimization problems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86096563" target="_blank" >RIV/61989100:27240/14:86096563 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-01781-5_25" target="_blank" >http://dx.doi.org/10.1007/978-3-319-01781-5_25</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-01781-5_25" target="_blank" >10.1007/978-3-319-01781-5_25</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Nelder-Mead simplex method with variables partitioning for solving large scale optimization problems

  • Original language description

    This paper presents a novel method to solve unconstrained continuous optimization problems. The proposed method is called SVP (simplex variables partitioning). The SVP method uses three main processes to solve large scale optimization problems. The firstprocess is a variable partitioning process which helps our method to achieve high performance with large scale and high dimensional optimization problems. The second process is an exploration process which generates a trail solution around a current iterate solution by applying the Nelder-Mead method in a random selected partitions. The last process is an intensification process which applies a local search method in order to refine the the best solution so far. The SVP method starts with a random initial solution, then it is divided into partitions. In order to generate a trail solution, the simplex Nelder-Mead method is applied in each partition by exploring neighborhood regions around a current iterate solution. Finally the intensif

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Advances in Intelligent Systems and Computing. Volume 237

  • ISBN

    978-3-319-01780-8

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    271-284

  • Publisher name

    Springer

  • Place of publication

    Basel

  • Event location

    Ostrava

  • Event date

    Aug 22, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article