Method of ``cleft-overstep by prependicular direction for solving the unconstrained nonlinear optimization problem

MaRDI QIDQ2277153zbMATH OpenFDO

Authors Nguyen Van Manh, Bui Minh Tri

Publication date 1990

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

unconstrained nonlinear optimization

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30)

Review text

We shall be concerned with the following unconstrained nonlinear optimization problems: ``minimize J(u), subject to \(u\in E^ n,\) where J(u) is a nonlinear function and \(E^ n\) is the n-dimensional Euclidean space. The authors [Tap Chi Toan Hoc 15, 1-13 (Vietnamese) (1987)] proposed previously an algorithm of ``cleft-overstep, also called the algorithm of quasi-bisectors for solving this problem. Based on this method we present here a new method called the algorithm of ``cleft- overstep in perpendicular direction. Some examples are given.

Recommendations

• scientific article; zbMATH DE number 1461863
• Quasi-newton methods for monlinear equations and unconstrained optimization problems
• A new method for solving unconstrained optimization problems
• An algorithm for unconstrained optimization
• scientific article; zbMATH DE number 4046982

This page was built for publication: Method of ``cleft-overstep by prependicular direction for solving the unconstrained nonlinear optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277153)