Skip to search formSkip to main contentSkip to account menu

Deterministic global optimization

Deterministic global optimization is a branch of numerical optimization which focuses on finding the global solutions of an optimization problem… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this paper, a new deterministic global optimization algorithm is proposed for solving a fractional programming problem whose… 
Review
2010
Review
2010
This paper presents an overview of the research progress in global optimization during the last 5 years (1998–2003), and a brief… 
2009
2009
A semi-deterministic global optimization method based on the search of a suitable initial condition for a given optimization… 
2009
2009
This paper presents a determined global optimization algorithm for solving linear fractional programming.After obtaining an… 
2008
2008
A deterministic global optimization algorithm is proposed for a class of fractional programming problem(P1),which can be… 
2006
2006
A new algorithm to solve nonconvex NLP problems is presented. It is based on the solution of two problems. The reformulated… 
2001
2001
  • H. Tuy
  • 2001
  • Corpus ID: 115539362
Convexity and monotonicity are two properties of crucial importance in the deterministic approaches to global optimization. An… 
2000
2000
Deterministic global optimization requires a global search with rejection of subregions. To reject a subregion, bounds on the… 
Highly Cited
1999
Highly Cited
1999
The αBB algorithm is a deterministically based global optimization method that has been successfully used to locate the global… 
1994
1994
Numerical methods for finding global solutions of nonlinear programming and multi-criterial optimization problems are proposed…