Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch

DOI10.1007/S40314-017-0505-2zbMath1409.90190OpenAlexW2755987995MaRDI QIDQ1993602

Giampaolo Liuzzi, Klaus Truemper

Publication date: 5 November 2018

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-017-0505-2

zbMATH Keywords

nonsmooth optimizationparallel algorithmsderivative-free optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52) Parallel algorithms in computer science (68W10)

Related Items (3)

Asynchronously parallel optimization solver for finding multiple minima ⋮ DFN ⋮ A geometric integration approach to nonsmooth, nonconvex optimisation

Uses Software

• Unnamed Item
• APPSPACK
• SDPEN
• DFL
• OPT++
• OrthoMADS
• TOMS659

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smooth method for the finite minimax problem
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
• Asynchronous Parallel Pattern Search for Nonlinear Optimization
• On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
• Algorithm 909
• Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
• Algorithm 856
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach
• Optimization and nonsmooth analysis
• Algorithm 659
• Direct Search Methods on Parallel Machines
• Uniformly distributed sequences with an additional uniform property
• On the Convergence of Asynchronous Parallel Pattern Search
• A Nonmonotone Line Search Technique for Newton’s Method
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• Benchmarking Derivative-Free Optimization Algorithms
• Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
• Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Seven Kinds of Convexity

This page was built for publication: Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch