Abstract
In this paper a method is described for solving linearly constrained nonlinear programming problems without evaluating any derivatives of the objective function. The algorithm uses the concept of active constraints and avoids the calculation of derivatives by approximating modified gradients and Hessian matrices by the aid of differences of function values. These approximations are calculated in such a way that the same convergence results are obtained as for any Quasi-Newton method.
Sign-in/Register to access full text options 
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.
