Accelerations for global optimization covering methods using second derivatives
From MaRDI portal
Publication:1318273
DOI10.1007/BF01098365zbMath0821.90095OpenAlexW2041908712MaRDI QIDQ1318273
William Baritompa, Adele Cutler
Publication date: 27 March 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01098365
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ On convergence of "divide the best" global optimization algorithms ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Cites Work
- Book review of: R. Paulavičius and J. Žilinskas: Simplicial global optimization
- Accelerations for a variety of global optimization methods
- A deterministic algorithm for global optimization
- Customizing methods for global optimization -- a geometric viewpoint
- An algorithm for finding the global maximum of a multimodal, multivariate function
- An algorithm for finding the absolute extremum of a function
- A Sequential Method Seeking the Global Maximum of a Function
- Numerical methods for finding global extrema (Case of a non-uniform mesh)