An infeasible point method for minimizing the Lennard-Jones potential

DOI10.1023/A:1008627606581zbMath0898.90121OpenAlexW2126508129MaRDI QIDQ1369366

Mark S. Gockenbach, William W. Symes, Anthony José Kearsley

Publication date: 20 October 1997

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008627606581

zbMATH Keywords

algorithmnumerical testslinear constraintspenalty methodsunconstrained global optimizationequality constrained nonlinear programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (1)

Algorithms for optimal signal set design

Uses Software

• L-BFGS

This page was built for publication: An infeasible point method for minimizing the Lennard-Jones potential