Algorithms for solving non-linear inequalities in a finite number of iterations using approximate derivatives
- 1 July 1987
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 46 (1) , 39-51
- https://doi.org/10.1080/00207178708933882
Abstract
We present two new algorithms, based on Newton's method, for solving a finite set of non-linear inequalities (under mild assumptions) in a finite number of iterations using approximate derivatives. The algorithms utilize function values at each iteration to evaluate an approximation to the gradient. The method is efficient when gradient evaluation is costly relative to function evaluations. The algorithms use a technique for systematic expansion of the linearized feasible set to ensure existence of a Newton-type search direction.Keywords
This publication has 6 references indexed in Scilit:
- An efficient algorithm for solving inequalitiesJournal of Optimization Theory and Applications, 1985
- Solving nonlinear inequalities in a finite number of iterationsJournal of Optimization Theory and Applications, 1981
- On the finite solution of nonlinear inequalitiesIEEE Transactions on Automatic Control, 1979
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- The Choice of Step Lengths When Using Differences to Approximate Jacobian MatricesIMA Journal of Applied Mathematics, 1974
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965