A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems.
Guangyu GaoBo HanShanshan TongPublished in: Math. Comput. Simul. (2022)
Keyphrases
- optimization method
- optimization algorithm
- simulated annealing
- nonlinear optimization
- optimization process
- global optimum
- learning algorithm
- optimal solution
- search space
- particle swarm
- probabilistic model
- hybrid algorithm
- neural network
- simulated annealing algorithm
- subspace clustering
- improved algorithm
- convergence rate
- cost function
- k means
- harmony search
- neural network training
- nelder mead simplex
- gradient information
- differential evolution
- high dimensional data
- genetic algorithm