A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
From MaRDI portal
Publication:1790670
DOI10.1007/s10589-017-9955-0zbMath1405.90114OpenAlexW2766184124MaRDI QIDQ1790670
Publication date: 2 October 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9955-0
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (11)
An adaptive direct multisearch method for black-box multi-objective optimization ⋮ Pareto front approximation through a multi-objective augmented Lagrangian method ⋮ An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation ⋮ A memetic procedure for global multi-objective optimization ⋮ A limited memory quasi-Newton approach for multi-objective optimization ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ On the extension of the \textsc{direct} algorithm to multiple objectives ⋮ Introduction to the special issue for SIMAI 2016 ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ MODIR ⋮ An augmented Lagrangian algorithm for multi-objective optimization
Uses Software
Cites Work
- Global optimization by multilevel partition
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Design and implementation of a massively parallel version of DIRECT
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Design-space dimensionality reduction in shape optimization by Karhunen-Loève expansion
- A partition-based global optimization algorithm
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- Globally-biased disimpl algorithm for expensive global optimization
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- A deterministic algorithm for global multi-objective optimization
- Direct Multisearch for Multiobjective Optimization
- A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
- Network Models and Optimization
- Introduction to Derivative-Free Optimization
- On convergence of "divide the best" global optimization algorithms
- Multicriteria Optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Benchmarking optimization software with performance profiles.
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
