Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
type: Item
instance of: scholarly article
title: Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
zbMATH Open document ID: 1351.90132
author: N. Karmitsa
published in: Journal of Optimization Theory and Applications
publication date: 2016-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6661402
zbMATH Keywords: Lennard-Jones potential
zbMATH Keywords: clustering problem
zbMATH Keywords: molecular conformation
zbMATH Keywords: nonsmooth optimisation
zbMATH Keywords: global optimisation
describes a project that uses: LDGB
MaRDI profile type: Publication
full work available at URL: s10957-016-0955-5
OpenAlex ID: W2470362604
Wikidata QID: Q109595614
cites work: Global optimization of protein-peptide docking by a filling function method
cites work: Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
cites work: Fast global optimization of difficult Lennard-Jones clusters
cites work: Nonsmooth optimization algorithm for solving clusterwise linear regression problems
cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization
cites work: Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
cites work: New limited memory bundle method for large-scale nonsmooth optimization
cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization
cites work: Optimization and nonsmooth analysis
cites work: Introduction to Nonsmooth Optimization
cites work: Comparing different nonsmooth minimization methods and software
cites work: Efficient algorithms for large scale global optimization: Lennard-Jones clusters
cites work: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
cites work: Global optima of Lennard-Jones clusters
cites work: Q3316093
cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
cites work: Representations of quasi-Newton matrices and their use in limited memory methods
DOI: 10.1007/S10957-016-0955-5
description: scientific article; zbMATH DE number 6661402