Login / Signup

A two-step improved Newton method to solve convex unconstrained optimization problems.

Tayebeh Dehghan NiriSeyed Abolfazl Shahzadeh FazeliMohammad Heydari
Published in: J. Appl. Math. Comput. (2020)
Keyphrases
  • newton method
  • optimality conditions
  • nonlinear programming
  • convergence analysis
  • convex optimization
  • dynamic programming
  • regularized least squares
  • knn
  • convex hull
  • variational inequalities