A numerical algorithm for finding solutions of p-Laplacian Dirichlet problems.
G. A. AfrouziZ. NaghizadehS. MahdaviPublished in: Appl. Math. Comput. (2007)
Keyphrases
- benchmark problems
- optimal solution
- optimal or near optimal
- dynamic programming
- optimization algorithm
- preprocessing
- k means
- test problems
- approximate solutions
- learning algorithm
- recognition algorithm
- significant improvement
- np hard
- solution space
- heuristic methods
- greedy algorithms
- cost function
- computational complexity
- iterative algorithms
- partial solutions
- similar problems
- exact solution
- solution quality
- combinatorial optimisation
- similarity measure
- objective function
- search space
- worst case
- particle swarm optimization
- approximation schemes
- computational cost
- probabilistic model
- efficient solutions
- simulated annealing
- convergence rate
- mixture model
- combinatorial problems
- detection algorithm
- clustering method
- energy function
- matching algorithm
- combinatorial optimization
- convex hull