In this paper the generalized Newton's method for LC¹ unconstrained optimization is investigated. This method is an extension of Newton's method for the smooth optimization. Some basic concepts are ...

The first laboratory work is devoted to optimization methods such as gradient descent and Newton's method. I implemented the methods themselves, the necessary oracles, as well as the linear search ...

Abstract: In this paper, we propose an efficient regular-ized quasi-Newton method for solving the unconstrained composite multiobjective optimization problem (UCMOP) where the objective functions are ...

Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems. They achieve efficiency by constructing search ...

ABSTRACT: In this paper, we propose new variants of Newton’s method based on quadrature formula and power mean for solving nonlinear unconstrained optimization problems. It is proved that the order of ...

Implementation of numerical optimization algorithms in MATLAB, including derivative-free and gradient-based methods for unconstrained problems, and projection techniques for constrained optimization.

ABSTRACT: A hybrid method of the Polak-Ribière-Polyak (PRP) method and the Wei-Yao-Liu (WYL) method is proposed for unconstrained optimization pro- blems, which possesses the following properties: i) ...