A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization

2013 ◽  
Vol 57 (1) ◽  
pp. 27-43
Author(s):  
Hongchao Zhang
Author(s):  
Christodoulos A. Floudas

This chapter discusses the fundamentals of nonlinear optimization. Section 3.1 focuses on optimality conditions for unconstrained nonlinear optimization. Section 3.2 presents the first-order and second-order optimality conditions for constrained nonlinear optimization problems. This section presents the formulation and basic definitions of unconstrained nonlinear optimization along with the necessary, sufficient, and necessary and sufficient optimality conditions. An unconstrained nonlinear optimization problem deals with the search for a minimum of a nonlinear function f(x) of n real variables x = (x1, x2 , . . . , xn and is denoted as Each of the n nonlinear variables x1, x2 , . . . , xn are allowed to take any value from - ∞ to + ∞. Unconstrained nonlinear optimization problems arise in several science and engineering applications ranging from simultaneous solution of nonlinear equations (e.g., chemical phase equilibrium) to parameter estimation and identification problems (e.g., nonlinear least squares).


2019 ◽  
Vol 24 (5) ◽  
pp. 86
Author(s):  
Zeyad M. Abdullah1 ◽  
Hameed M, Sadeq2 ◽  
, Hisham M, Azzam3 ◽  
Mundher A. Khaleel4

The current paper modified method of conjugate gradient for solving problems of unconstrained optimization. The modified method convergence is achieved by assuming some hypotheses. The statistical results demonstrate that the modified method is efficient for solving problems of Unconstrained Nonlinear Optimization in comparison with methods FR and HS.   http://dx.doi.org/10.25130/tjps.24.2019.095


Sign in / Sign up

Export Citation Format

Share Document