Abstract

Numerical search methods are widely used to solve nonlinear programming problems. This chapter discusses various gradient and nongradient numerical search methods that have wide engineering applications. Various one-dimensional gradient search methods and polynomial approximation methods that are effective in practice are discussed with examples of nonlinear optimization problems. Multivariable gradient search methods and multivariable nongradient search methods have wide applications in solving optimization problems in different domains. Various search methods used to solve multidimensional optimization problems are discussed with solution strategies and applications of nonlinear programming problems.

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 call

Disclaimer: 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.