Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem.
Müzeyyen ErtürkAhmet SalkimPublished in: Optim. Lett. (2023)
Keyphrases
- gradient projection
- learning algorithm
- optimization algorithm
- cost function
- simulated annealing
- detection algorithm
- computational cost
- convex minimization
- significant improvement
- convergence rate
- worst case
- combinatorial optimization
- matching algorithm
- optimal solution
- computationally efficient
- quadratic optimization problems
- artificial intelligence
- iterative algorithms
- hybrid algorithm
- genetic algorithm ga
- image segmentation
- similarity measure
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- neural network
- objective function
- k means
- evolutionary algorithm
- association rules
- preprocessing
- computational complexity