On the convergence of global methods in multiextremal optimization

DOI10.1007/BF00939434zbMath0595.90079OpenAlexW2009932764MaRDI QIDQ1078082

Hoang Tuy, Reiner Horst

Publication date: 1987

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationbranch-and-boundmultiextremal optimizationderivative-free optimization proceduresLipschitzian optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (36)

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities ⋮ Chebyshev approximation of a point set by a straight line ⋮ 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 ⋮ The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities ⋮ Finding maximum likelihood estimators for the three-parameter Weibull distribution ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ 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 ⋮ \(\alpha BB\): A global optimization method for general constrained nonconvex problems ⋮ Decomposition approach for the global minimization of biconcave functions over polytopes ⋮ A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure ⋮ Globally optimized calibration of environmental models ⋮ Multidimensional bisection applied to global optimisation ⋮ Method for minimizing a convex-concave function over a convex set ⋮ An analytical approach to global optimization ⋮ When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Multidimensional bisection: the performance and the context ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ An application of Lipschitzian global optimization to product design ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ A note on adapting methods for continuous global optimization to the discrete case ⋮ On convergence of "divide the best" global optimization algorithms ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities ⋮ A new class of improved convex underestimators for twice continuously differentiable constrained NLPs ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ Concave minimization via conical partitions and polyhedral outer approximation ⋮ Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems ⋮ Lipschitzian optimization without the Lipschitz constant ⋮ A parallel method for finding the global minimum of univariate functions

Cites Work

• Unnamed Item
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• The cubic algorithm
• Globally convergent methods for n-dimensional multiextremal optimization
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function

This page was built for publication: On the convergence of global methods in multiextremal optimization