Skip to search formSkip to main contentSkip to account menu

Local optimum

Known as: Local optima, Local optimality, Locally optimal 
In applied mathematics and computer science, a local optimum of an optimization problem is a solution that is optimal (either maximal or minimal… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
AlgorithmAutomatic label placementBroyden–Fletcher–Goldfarb–Shanno algorithmCluster analysis

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A Particle Swarm Optimization Algorithm with Differential Evolution
Differential evolution (DE) is a simple evolutionary algorithm that has shown superior performance in the global continuous… 
Highly Cited
2004
Highly Cited
2004
Modeling of optical absorption in conjugated polymer/fullerene bulk-heterojunction plastic solar cells
Highly Cited
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
2002
Highly Cited
2002
Dynamic Data Structures for a Direct Search Algorithm
The DIRECT (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (Journal of Optimization Theory and Applications… 
Highly Cited
2001
Highly Cited
2001
A study on non-random mating and varying population size in genetic algorithms using a royal road function
We present a study on the effects of non-random mating and varying population size in genetic algorithm (GA) performance. We… 
Highly Cited
2001
Highly Cited
2001
Capturing outline of fonts using genetic algorithm and splines
In order to obtain a good spline model from large measurement data, we frequently have to deal with knots as variables, which… 
Highly Cited
1997
Highly Cited
1997
A locally optimal handoff algorithm for cellular communications
The design of handoff algorithms for cellular communication systems based on mobile signal strength measurements is considered… 
Highly Cited
1997
Highly Cited
1997
The role of linear semi-infinite programming in signal-adapted QMF bank design
We consider the problem of designing a perfect-reconstruction, FIR, quadrature-mirror filter (QMF) bank (H, G) adapted to input… 
Highly Cited
1994
Highly Cited
1994
Using a genetic algorithm to optimize problems with feasibility constraints
G.E. Liepins et al. (1990) have shown that genetic algorithm optimization of certain combinatorial optimization problems can be… 
Highly Cited
1989
Highly Cited
1989
A Bayesian Approach to Reconstruction from Incomplete Projections of a Multiple Object 3D Domain
An estimation approach is described for three-dimensional reconstruction from line integral projections using incomplete and very… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)