Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems

DOI10.1007/s10957-016-0955-5zbMath1351.90132OpenAlexW2470362604WikidataQ109595614 ScholiaQ109595614MaRDI QIDQ727242

Napsu Karmitsa

Publication date: 6 December 2016

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

Full work available at URL: https://doi.org/10.1007/s10957-016-0955-5

zbMATH Keywords

molecular conformationglobal optimisationclustering problemLennard-Jones potentialnonsmooth optimisation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (2)

A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ On the accurate identification of active set for constrained minimax problems

Uses Software

• LDGB

Cites Work

• Unnamed Item
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Representations of quasi-Newton matrices and their use in limited memory methods
• Global optima of Lennard-Jones clusters
• Efficient algorithms for large scale global optimization: Lennard-Jones clusters
• Nonsmooth optimization algorithm for solving clusterwise linear regression problems
• Global optimization of protein-peptide docking by a filling function method
• Comparing different nonsmooth minimization methods and software
• Introduction to Nonsmooth Optimization
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
• Optimization and nonsmooth analysis
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
• New limited memory bundle method for large-scale nonsmooth optimization
• Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
• Fast global optimization of difficult Lennard-Jones clusters

This page was built for publication: Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems