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”

Linear interval parametric approach to testing pseudoconvexity

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437027" target="_blank" >RIV/00216208:11320/21:10437027 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=22d0Th39sJ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=22d0Th39sJ</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10898-020-00924-w" target="_blank" >10.1007/s10898-020-00924-w</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Linear interval parametric approach to testing pseudoconvexity

  • Original language description

    The recent paper (DOI: 10.1007/s10898-017-0537-6) suggests various practical tests (sufficient conditions) for checking pseudoconvexity of a twice differentiable function on an interval domain. The tests were implemented using interval extensions of the gradient and the Hessian of the function considered. In this paper, we present an alternative approach which is based on the use of more accurate affine form enclosures and affine arithmetic. We modify the tests to work with linear interval parametric enclosures of the gradients and the Hessians. We also present computational complexity results, showing that performing some tests exactly is NP-hard. It is shown by numerical experiments on random and benchmark data that the new approach results in more efficient tests for checking pseudoconvexity, however, at the expense of higher computation time. (C) 2020, Springer Science+Business Media, LLC, part of Springer Nature.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • 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

  • Name of the periodical

    Journal of Global Optimization

  • ISSN

    0925-5001

  • e-ISSN

  • Volume of the periodical

    79

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    351-368

  • UT code for WoS article

    000552934600003

  • EID of the result in the Scopus database

    2-s2.0-85088662812