An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints.
Saeid Ansary KarbasyAbdelouahed HamdiMaziar SalahiAkram TaatiPublished in: Optim. Lett. (2021)
Keyphrases
- trust region
- np hard
- linear constraints
- objective function
- cost function
- worst case
- dynamic programming
- simulated annealing
- learning algorithm
- search space
- genetic algorithm
- optimization algorithm
- optimization method
- optimal solution
- evolutionary algorithm
- optimization problems
- expectation maximization
- convex hull
- log likelihood
- levenberg marquardt