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