A filling function method for unconstrained global optimization

DOI10.1007/s10589-015-9728-6zbMath1326.90064OpenAlexW1987390949MaRDI QIDQ493693

Giampaolo Liuzzi, Francesco Lampariello

Publication date: 4 September 2015

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

Full work available at URL: https://doi.org/10.1007/s10589-015-9728-6

zbMATH Keywords

global optimizationgradient methodsunconstrained minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (3)

Optimal switching control for drug therapy process in cancer chemotherapy ⋮ Gradient surfing: a new deterministic approach for low-dimensional global optimization ⋮ Global optimization of protein-peptide docking by a filling function method

Uses Software

• Global Optimization Toolbox For Maple
• LGO
• L-BFGS-B
• Algorithm 829
• LBFGS-B
• CEC 13
• DDFSA
• DFSA

Cites Work

• Unnamed Item
• Unnamed Item
• New global optimization methods for ship design problems
• A global optimization method for the design of space trajectories
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• A filled function method for finding a global minimizer of a function of several variables
• Modified Cholesky algorithms: A catalog with new approaches
• Handbook of test problems in local and global optimization
• Lipschitzian optimization without the Lipschitz constant
• Stochastic and global optimization. Dedicated to Prof. Jonas Močkus on his 70th birthday (June 18, 2001)
• Variable neighborhood search
• Efficient algorithms for large scale global optimization: Lennard-Jones clusters
• Handbook of global optimization. Vol. 2
• A magnetic resonance device designed via global optimization techniques
• On the multilevel structure of global optimization problems
• New classes of globally convexized filled functions for global optimization
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• A partition-based global optimization algorithm
• A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
• The Tunneling Algorithm for the Global Minimization of Functions
• Algorithm 778: L-BFGS-B
• A Limited Memory Algorithm for Bound Constrained Optimization
• Algorithm 829
• Global optimization
• Introduction to global optimization.
• Global optimization on funneling landscapes
• Variable neighborhood search: Principles and applications

This page was built for publication: A filling function method for unconstrained global optimization