Next: Unconstrained optimization
Up: Zhang: Automatic picking
In the last section, I showed that automatic dip-picking
can be accomplished by solving an optimization problem.
Because the objection functions I considered are non-quadratic functions
of unknown parameter p, the optimization problem is non-linear.
In this section, I use a fast search algorithm to solve this non-linear
Stanford Exploration Project