Extended univariate algorithms for \(n\)-dimensional global optimization

From MaRDI portal
Publication:1062427

DOI10.1007/BF02238195zbMath0572.65047OpenAlexW69776077MaRDI QIDQ1062427

B. George

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238195



Related Items

Global optimization on convex sets, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities, Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions, An implicit enumeration method for global optimization problems, On the selection of subdivision directions in interval branch-and-bound methods for global optimization, New LP bound in multivariate Lipschitz optimization: Theory and applications, A note on ``Extended univariate algorithms by J. Pinter, Steepest descent with curvature dynamical system, Uniform tree approximation by global optimization techniques, On the convergence of adaptive partition algorithms in global optimization, Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure, Topics in Lipschitz global optimisation, Globally optimized calibration of environmental models, Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives, A global minimization algorithm for Lipschitz functions, Convergence qualification of adaptive partition algorithms in global optimization, Global optimization of univariate Lipschitz functions. I: Survey and properties, An application of Lipschitzian global optimization to product design, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, On tightness and anchoring of McCormick and other relaxations, On convergence of "divide the best" global optimization algorithms, Solving nonlinear equation systems via global partition and search: Some experimental results, The impact of accelerating tools on the interval subdivision algorithm for global optimization, Global one-dimensional optimization using smooth auxiliary functions, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, A statistical model for global optimization by means of select and clone, Stochastic modelling and optimization for environmental management, Interval method for bounding level sets: Revisited and tested with global optimization problems, Set partition by globally optimized cluster seed points, On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients



Cites Work