Globally convergent methods for n-dimensional multiextremal optimization
From MaRDI portal
Publication:3727749
DOI10.1080/02331938608843118zbMath0595.90071OpenAlexW1978837378MaRDI QIDQ3727749
No author found.
Publication date: 1986
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938608843118
convergenceefficiencymultiextremal optimizationsolution proceduresLipschitz-continuous objective function
Related Items
On the convergence of global methods in multiextremal optimization, 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, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, New LP bound in multivariate Lipschitz optimization: Theory and applications, On the convergence of adaptive partition algorithms in global optimization, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure, Topics in Lipschitz global optimisation, Globally optimized calibration of environmental models, Convergence qualification of adaptive partition algorithms in global optimization, Global optimization of univariate Lipschitz functions. I: Survey and properties, MSO: a framework for bound-constrained black-box 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, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Stochastic modelling and optimization for environmental management, Set partition by globally optimized cluster seed points, Lipschitzian optimization without the Lipschitz constant
Cites Work
