Modified Projected Newton Scheme for Non-convex Function with Simple Constraints

  • Suvra Kanti Chakraborty Sir Gurudas Mahavidyalaya, Kolkata
  • Geetanjali Panda

Abstract

In this paper, a descent line search scheme is proposed to find a local minimum point of a non-convex optimization problem with simple constraints. The idea ensures that the scheme escapes the saddle point and finally settles for a local minimum point of the non-convex optimization problem.
Positive definite scaling matrix for the proposed scheme is formed through symmetric indefinite
matrix factorization of the Hessian matrix of the objective function at each iteration. Numerical
illustrations are provided and global convergence of the scheme is also justified.

Published
2021-01-12
How to Cite
CHAKRABORTY, Suvra Kanti; PANDA, Geetanjali. Modified Projected Newton Scheme for Non-convex Function with Simple Constraints. Yugoslav Journal of Operations Research, [S.l.], v. 31, n. 3, jan. 2021. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/854>. Date accessed: 14 nov. 2024.
Section
Articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.