A nonsmooth global optimization technique using slopes: The one-dimensional case
From MaRDI portal
Publication:1304345
DOI10.1023/A:1008391326993zbMath0959.65078MaRDI QIDQ1304345
Publication date: 22 September 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (17)
A second-order pruning step for verified global optimization ⋮ Globale Optimierung nichtdifferenzierbarer Funktionen unter Einsatz von Intervallsteigungen ⋮ A filled function method applied to nonsmooth constrained global optimization ⋮ Computing slope enclosures by exploiting a unique point of inflection ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ A Branch-and-Prune Method for Global Optimization ⋮ On Fibonacci search method with \(k\)-Lucas numbers. ⋮ An improvement on Fibonacci search method in optimization theory. ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ New filled functions for nonsmooth global optimization ⋮ A one-parameter filled function method applied to nonsmooth constrained global optimization ⋮ An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial ⋮ Slope enclosures for functions given by two or more branches ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ Optimal centers in branch-and-prune algorithms for univariate global optimization ⋮ A new pruning test for finding all global minimizers of nonsmooth functions ⋮ A new inclusion function for optimization: kite -- the one-dimensional case
Uses Software
This page was built for publication: A nonsmooth global optimization technique using slopes: The one-dimensional case
