An Infeasible Point Method for Minimizing the Lennard-Jones Potential
dc.contributor.author | Gockenbach, Mark S. | en_US |
dc.contributor.author | Kearsley, Anthony J. | en_US |
dc.contributor.author | Symes, William W. | en_US |
dc.date.accessioned | 2006-09-11T15:16:25Z | |
dc.date.available | 2006-09-11T15:16:25Z | |
dc.date.issued | 1997-11 | en_US |
dc.identifier.citation | Gockenbach, Mark S.; Kearsley, Anthony J.; Symes, William W.; (1997). "An Infeasible Point Method for Minimizing the Lennard-Jones Potential." Computational Optimization and Applications 8(3): 273-286. <http://hdl.handle.net/2027.42/44788> | en_US |
dc.identifier.issn | 0926-6003 | en_US |
dc.identifier.issn | 1573-2894 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/44788 | |
dc.description.abstract | Minimizing the Lennard-Jones potential, the most-studied modelproblem for molecular conformation, is an unconstrained globaloptimization problem with a large number of local minima. In thispaper, the problem is reformulated as an equality constrainednonlinear programming problem with only linear constraints. Thisformulation allows the solution to approached through infeasibleconfigurations, increasing the basin of attraction of the globalsolution. In this way the likelihood of finding a global minimizeris increased. An algorithm for solving this nonlinear program isdiscussed, and results of numerical tests are presented. | en_US |
dc.format.extent | 99758 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Convex and Discrete Geometry | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Operations Research, Mathematical Programming | en_US |
dc.subject.other | Statistics, General | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Global Optimization | en_US |
dc.subject.other | Penalty Methods | en_US |
dc.subject.other | Non Linear Programming | en_US |
dc.title | An Infeasible Point Method for Minimizing the Lennard-Jones Potential | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI, 48109-0001 | en_US |
dc.contributor.affiliationother | Applied and Computational Mathematics Division, National Institute of Standards and Technology, Gaithersburg, MD, 20899 | en_US |
dc.contributor.affiliationother | Department of Computational & Applied Mathematics, Rice University, Houston, Texas, 77251-1892 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/44788/1/10589_2004_Article_140555.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1008627606581 | en_US |
dc.identifier.source | Computational Optimization and Applications | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.