New interval analysis support functions using gradient information in a global minimization algorithm
From MaRDI portal
Publication:1411328
DOI10.1023/A:1022512411995zbMath1046.90060MaRDI QIDQ1411328
Publication date: 27 October 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (13)
A review of recent advances in global optimization ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ Combination of two underestimators for univariate global optimization ⋮ Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Interval oriented multi-section techniques for global optimization ⋮ Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions ⋮ Optimal centers in branch-and-prune algorithms for univariate global optimization ⋮ A new inclusion function for optimization: kite -- the one-dimensional case ⋮ Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem
Uses Software
This page was built for publication: New interval analysis support functions using gradient information in a global minimization algorithm
