Abstarct
We again assume f, g 1,…, g m , h 1,…,h p to be continuously differentiable realvalued functions on ℝn with n ∈ ℕ and m, p ∈ ℕ0, and consider the problem
or short
with the set of feasible points
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Fiacco, G. McCormick (1990): Nonlinear Programming — Sequential Unconstrained Minimization Techniques. SIAM, Philadelphia
M. J. D. Powell (1977): A Fast Algorithm for Nonlinearly Constrained Optimization Calculations. In: Numerical Analysis, Dundee 1977. Lecture Notes in Mathematics 630. Springer, Berlin, Heidelberg, New York, pp. 144–157
R. Fletcher (2006): Practical Methods of Optimization. Wiley, Chichester
M. J. D. Powell (1986): Convergence Properties of Algorithms for Nonlinear Optimization. SIAM Review 28, pp. 487–500
R. Fletcher (2006): Practical Methods of Optimization. Wiley, Chichester
G. Debreu (1952): Definite and Semidefinite Quadratic Forms. Econometrica 20, pp. 295–300
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Forst, W., Hoffmann, D. (2010). Nonlinearly Constrained Optimization Problems. In: Optimization—Theory and Practice. Springer Undergraduate Texts in Mathematics and Technology . Springer, New York, NY. https://doi.org/10.1007/978-0-387-78977-4_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-78977-4_5
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-78976-7
Online ISBN: 978-0-387-78977-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)