Solving Nonlinear Programs Without Using Analytic Derivatives

DOI10.1287/OPRE.27.3.457zbMATH Open0417.90079OpenAlexW2071865449MaRDI QIDQ3208451FDOQ3208451

Authors: Jerrold H. May 

Publication date: 1979

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.27.3.457

zbMATH Keywords

rate of convergencecomputational resultstest problemsnonlinear programsnumerical experiencelinear inequality constraintscomputer codedifferentiability conditionslocal variations-approximate Newton nonderivative methodminimization of a nonlinear functionno analytic derivatives

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (3)

• Optimal new product positioning: A genetic algorithm approach
• Optimal positioning of new product-concepts: Some analytical implications and empirical results
• Derivative-free optimization methods

This page was built for publication: Solving Nonlinear Programs Without Using Analytic Derivatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208451)