Published online by Cambridge University Press: 05 February 2016
Introduction
When the optimization of an objective function is required without any additional correlation, then this optimization is called unconstrained optimization. Unconstrained optimization problem appears in some cases in chemical engineering. It is the simplest multivariable optimization problem. Parameter estimation is a significant application in engineering and science, where, multivariable unconstrained optimization methods are required. Some optimization problems are inherently unconstrained; there is no additional function (section 2.7, 2.8). When there are some usual constraints on the variables, it is better to ignore these constraints and to consider that they do not have any impact on the optimal solution. Unconstrained problems also formed due to reconstructions of constrained optimization problems, in which the penalization terms are used to replace the constraints in the objective function that have the effect of discouraging constraint violations.
Rarely do we get any unconstrained problem as a practical design problem, the knowledge on this type of optimization problems is essential for the following purposes:
The constraints hold very less influence in some design problems.
To get basic idea about constrained optimization, the study of unconstrained optimization techniques is necessary.
Solving the unconstrained optimization problem is quite easy compared to constrained optimization.
Some robust and efficient methods are required for the numerical optimization of any nonlinear multivariable objective functions. The efficiency of the algorithm is very significant because these optimization problems require an iterative solution process, and this trial and error becomes unfeasible when number of variables is more than three. Generally, it is very difficult to predict the behavior of nonlinear function; there may exist local minima or maxima, saddle points, regions of convexity, and concavity. Therefore, robustness (the capability to get a desired solution) is desirable for these methods. In some regions, the optimization algorithm may proceed quite slowly toward the optimum, demanding excessive computational time. In this chapter, we will discuss various nonlinear programming algorithms for unconstrained optimization.
Formulation of Unconstrained Optimization
For an unconstrained optimization problem, we minimize the objective function that is constructed with real variables, without any limitations on the values of these variables.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.