An efficient implementation of optimization algorithms

Jean Vignes

Mathematics and Computers in Simulation (MATCOM), 1984, vol. 26, issue 3, 243-256

Abstract: In implementing any optimization method on a computer, several problems arise: •how to break off the iterative process;•how to determine the satisfactory computed solution and be sure the computer cannot provide a better one;•how to tell whether or not computed solution approximates the mathematical solution, and to what degree of accuracy. New methods of solving these problems are presented in this paper.

Date: 1984
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475484900612
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:26:y:1984:i:3:p:243-256

DOI: 10.1016/0378-4754(84)90061-2

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().