Convergence of a steepest descent algorithm in shape optimisation using $W^{1, \infty}$ functions.
Klaus DeckelnickPhilip J. HerbertMichael HinzePublished in: CoRR (2023)
Keyphrases
- cost function
- convergence rate
- significant improvement
- experimental evaluation
- high accuracy
- computationally efficient
- convergence property
- linear programming
- iterative algorithms
- computational cost
- image restoration
- times faster
- segmentation algorithm
- shape descriptors
- probabilistic model
- k means
- search space
- preprocessing
- convergence proof
- rapid convergence
- learning algorithm
- detection algorithm
- particle filter
- particle swarm optimization
- simulated annealing
- np hard
- optimal solution
- objective function