Globally convergent methods for n-dimensional multiextremal optimization

DOI10.1080/02331938608843118MaRDI QIDQ3727749zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938608843118

zbMATH Keywords

convergenceefficiencyLipschitz-continuous objective functionmultiextremal optimizationsolution procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• On the convergence of global methods in multiextremal optimization
• Multidimensional bisection applied to global optimisation
• Adaptive global optimization based on a block-recursive dimensionality reduction scheme
• scientific article; zbMATH DE number 1795727
• Extended univariate algorithms for n-dimensional global optimization

Cites work

• A Sequential Method Seeking the Global Maximum of a Function
• A stochastic method for global optimization
• Axiomatic approach to statistical models and their use in multimodal optimization theory
• Convergence properties of stochastic optimization procedures
• scientific article; zbMATH DE number 3485507 (Why is no real title available?)

Cited in

(27)

• Extended univariate algorithms for n-dimensional global optimization
• 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
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Convergence qualification of adaptive partition algorithms in global optimization
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Lipschitzian optimization without the Lipschitz constant
• The impact of accelerating tools on the interval subdivision algorithm for global optimization
• New LP bound in multivariate Lipschitz optimization: Theory and applications
• On the use of finite differences in the multistart method for solving a certain class of global optimization
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities
• Global optimization of nonconvex problems with multilinear intermediates
• scientific article; zbMATH DE number 4156224 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1543292 (Why is no real title available?)
• MSO: a framework for bound-constrained black-box global optimization algorithms
• Solving nonlinear equation systems via global partition and search: Some experimental results
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
• Multidimensional bisection: the performance and the context
• Stochastic modelling and optimization for environmental management
• Set partition by globally optimized cluster seed points
• Adaptive global optimization based on a block-recursive dimensionality reduction scheme
• Globally optimized calibration of environmental models

This page was built for publication: Globally convergent methods for n-dimensional multiextremal optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727749)