Optimization Techniques_crossword1

1234567891011
Across
  1. 5. A new point generated by the algorithm yields a reduced value of the function
  2. 7. the least no.that is greater than every element in the set
  3. 8. The point which is neither a minimum nor maximum
  4. 9. _____ order algorithms use only gardient information
  5. 10. If a set is _ then a minimum exists
  6. 11. exists if the Hessian is greater than zero
Down
  1. 1. the greates no.that is less than every element in the set
  2. 2. a function is concave if its associated matrix is ___ definite
  3. 3. Any algorithm should be ______
  4. 4. the point where the slope is zero
  5. 6. if a function is convex, then the minima attained is
  6. 7. _____ order algorithms are faster but require huge memory