2004•Unpublished venueRequires access

A hybrid algorithm for unconstrained optimization problems

Ruopeng Wang

Abstract

A hybrid iterative algorithm for unconstrained optimization problems is formulated by means of combining organically the steepest decent method and Newton method.This hybrid algorithm not only inherits the merit of Newton method that there is fast convergence at the adjacency of the minimum but also overcomes the difficulty happened with the latter method in problem solution.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Convergence (economics), Mathematical optimization, Algorithm, Computer science, Iterative method, Mathematics, Optimization problem, Hybrid algorithm (constraint satisfaction)