Pages that link to "Item:Q1304345"
From MaRDI portal
The following pages link to A nonsmooth global optimization technique using slopes: The one-dimensional case (Q1304345):
Displaying 18 items.
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- A second-order pruning step for verified global optimization (Q839324) (← links)
- A filled function method applied to nonsmooth constrained global optimization (Q843147) (← links)
- New filled functions for nonsmooth global optimization (Q965609) (← links)
- A one-parameter filled function method applied to nonsmooth constrained global optimization (Q979943) (← links)
- Slope enclosures for functions given by two or more branches (Q1014884) (← links)
- On Fibonacci search method with \(k\)-Lucas numbers. (Q1399814) (← links)
- An improvement on Fibonacci search method in optimization theory. (Q1412651) (← links)
- A hybrid global optimization method: The one-dimensional case (Q1860412) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- Computing slope enclosures by exploiting a unique point of inflection (Q2378918) (← links)
- Optimal centers in branch-and-prune algorithms for univariate global optimization (Q2572338) (← links)
- A new pruning test for finding all global minimizers of nonsmooth functions (Q2572719) (← links)
- A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial (Q3627691) (← links)
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
- Globale Optimierung nichtdifferenzierbarer Funktionen unter Einsatz von Intervallsteigungen (Q4268696) (← links)
- A Branch-and-Prune Method for Global Optimization (Q4577117) (← links)