Abstract
Throughout this chapter, we only treat the minimization problem for convex functions (see Definition 24.23). Furthermore, in most cases, we assume that the objective function being minimized is a quadratic function. These minimization assumptions may easily cover the cases where a function needs to be maximized. In the case of concave functions (Definition 24.25), where we are interested in the maxima, the function may be multiplied by -1 which inverts it into a convex function such that the location of the maximum now points to the minimum of the new function. So, the maximization function is changed to a minimization function.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Beigi, H. (2011). Nonlinear Optimization. In: Fundamentals of Speaker Recognition. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77592-0_25
Download citation
DOI: https://doi.org/10.1007/978-0-387-77592-0_25
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77591-3
Online ISBN: 978-0-387-77592-0
eBook Packages: Computer ScienceComputer Science (R0)