Implementation of novel methods of global and nonsmooth optimization: GANSO programming library

DOI10.1080/02331930701617429zbMath1127.65033OpenAlexW2088391832MaRDI QIDQ5426958

Gleb Beliakov, Julien Ugon

Publication date: 16 November 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/41350

zbMATH Keywords

global optimizationnonsmooth optimizationnonlinear programmingcutting angle methodnumerical optimizationderivative-free bundle methodprogramming library GANSO

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Packaged methods for numerical algorithms (65Y15)

Related Items (6)

DETECTING K-COMPLEXES FOR SLEEP STAGE IDENTIFICATION USING NONSMOOTH OPTIMIZATION ⋮ Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails ⋮ Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY ⋮ Global non-smooth optimization in robust multivariate regression ⋮ Aggregation functions based on penalties ⋮ Derivative-free optimization and neural networks for robust regression

Uses Software

• GANSO
• Maple
• Matlab

Cites Work

• Challenges of continuous global optimization in molecular structure prediction
• Cutting angle method and a local search
• Geometry and combinatorics of the cutting angle method

This page was built for publication: Implementation of novel methods of global and nonsmooth optimization: GANSO programming library