Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem

DOI10.1023/A:1013894710280zbMath1045.90079OpenAlexW1500261914MaRDI QIDQ598590

Hong-Xuan Huang, Panos M. Pardalos, Zuo-Jun Max Shen

Publication date: 12 August 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Global optimizationCode partition algorithmExtremal Lennard-Jones codeL-Points Pattern Lennard-Jones codeLennard-Jones problemPotential energy function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (4)

Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology

This page was built for publication: Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem