FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
050019362016

Related topics

Related topics

25 relations
AlgorithmAutomatic label placementBroyden–Fletcher–Goldfarb–Shanno algorithmCluster analysis
(More)

Broader (1)

Mathematical optimization

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Local optimum
Algorithm
Mathematical optimization
Optimization problem
Genetic algorithm
Computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Rate-distortion optimized streaming of packetized media
This paper addresses the problem of streaming packetized media over a lossy packet network in a rate-distortion optimized way. We… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Nonlinear Dimensionality Reduction
The visual interpretation of data is an essential step to guide any further processing or decision making. Dimensionality… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill climbing optimization methods can fail is that they become trapped in local op… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Evolutionary programming made faster
Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent… (More)
  • figure 1
  • table II
  • table I
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability… (More)
  • table 6
  • table 7
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems
| The combination of local search heuristics and genetic algorithms is a promising approach for nding near-optimum solutions to… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A Robust Technique for Matching two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry
This paper proposes a robust approach to image matching by exploiting the only available geometric constraint, namely, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Noise Strategies for Improving Local Search
It has recently been shown that local search is sur prisingly good at nding satisfying assignments for certain computationally… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Numerical potential field techniques for robot path planning
The authors investigate a path planning approach that consists of concurrently building and searching a graph connecting the… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
How easy is local search?
One of the few general approaches to difficult combinatorial optimization problems that has met with empirical success is local… (More)
Is this relevant?