Abstract | ||
---|---|---|
We study the problem of checking pseudoconvexity of a twice differentiable function on an interval domain. Based on several characterizations of pseudoconvexity of a real function, we propose sufficient conditions for verifying pseudoconvexity on a domain formed by a Cartesian product of real intervals. We carried out numerical experiments to show which methods perform well from two perspectives—the computational complexity and effectiveness of recognizing pseudoconvexity. |
Year | DOI | Venue |
---|---|---|
2018 | https://doi.org/10.1007/s10898-017-0537-6 | J. Global Optimization |
Keywords | Field | DocType |
Global optimization,Interval computation,Pseudoconvexity | Mathematical optimization,Global optimization,Pseudoconvexity,Mathematical analysis,Cartesian product,Differentiable function,Interval arithmetic,Real-valued function,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
71 | 3 | 0925-5001 |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Milan Hladík | 1 | 268 | 36.33 |