Abstract
In this section we consider a method for solving a general mathematical programming problem with no convexity assumptions on the functions involved. One important feature of this method is that it is able to take account of nonlinear equality-type constraints, which form a stumbling block for most other methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pshenichnyj, B.N. (1994). The Linearization Method. In: The Linearization Method for Constrained Optimization. Springer Series in Computational Mathematics, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57918-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-57918-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63401-7
Online ISBN: 978-3-642-57918-9
eBook Packages: Springer Book Archive