Phương pháp hướng phân giác giải bài toán tối ưu hóa không ràng buộc tổng quát
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/4/1/11186Abstract
In this paper the general unconstrained optimization problem ts considered. Here are new method, called the method of “bisector direction”, is proposed for solving this problem. Our algorithm is based on the convergence theorems and it has a high rate of convergence. Some example are given also.
Metrics
Metrics Loading ...
Downloads
Published
02-02-2018
How to Cite
[1]
N. V. Manh, B. M. Tri, and N. T. Loan, “Phương pháp hướng phân giác giải bài toán tối ưu hóa không ràng buộc tổng quát”, JCC, vol. 4, no. 1, p. 9–14, Feb. 2018.
Issue
Section
Cybernetics
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
