Abstract
An algorithm using second derivatives for solving the optimization problem : minimize $f(x)$ subject to $g_i (x) \geqq 0$, $i = 1, \cdots ,m$, where the $g_i $ are not necessarily linear is presented. The basic idea is to generate a sequence of feasible points with decreasing objective value by movement along piecewise, smooth, quadratic arcs. Cluster points of the sequence generated are shown to be second order Kuhn–Tucker points. If the strict second order sufficiency conditions hold, the rate of convergence is shown to be at least quadratic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
