An infeasible point method for minimizing the Lennard-Jones potential

DOI10.1023/A:1008627606581zbMATH Open0898.90121OpenAlexW2126508129MaRDI QIDQ1369366FDOQ1369366

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

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

algorithmpenalty methodsunconstrained global optimizationlinear constraintsnumerical testsequality constrained nonlinear programming

Mathematics Subject Classification ID

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

Cited In (3)

• Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
• Starting-point strategies for an infeasible potential reduction method
• Algorithms for optimal signal set design

Uses Software

• L-BFGS

   Recommendations

• Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Fast global optimization of difficult Lennard-Jones clusters 👍 👎
• Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems 👍 👎

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

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