On the convergence of global methods in multiextremal optimization

Cites Work

Title not available (Why is that?)
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
An algorithm for finding the global maximum of a multimodal, multivariate function
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Globally convergent methods for n-dimensional multiextremal optimization
The cubic algorithm

Cited In (40)

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

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

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