On the use of polynomial models in multiobjective directional direct search
type: Item
instance of: scholarly article
title: On the use of polynomial models in multiobjective directional direct search
zbMATH Open document ID: 1466.90095
author: Carmo P. Brás
author: A. L. Custódio
published in: Computational Optimization and Applications
publication date: 2021-05-03T00:00:00Z
full work available at URL: http://hdl.handle.net/10362/115775
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7342443
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: direct search methods
zbMATH Keywords: quadratic polynomial interpolation and regression
zbMATH Keywords: minimum Frobenius norm models
describes a project that uses: MOIF
describes a project that uses: DFMO
describes a project that uses: MultiGLODS
describes a project that uses: NEWUOA
describes a project that uses: Sheppack
MaRDI profile type: Publication
OpenAlex ID: W3093154753
cites work: Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection
cites work: Derivative-Free and Blackbox Optimization
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Multiobjective Optimization Through a Series of Single-Objective Formulations
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: Portfolio management with higher moments: the cardinality impact
cites work: A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
cites work: Q3996569
cites work: An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
cites work: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
cites work: Introduction to Derivative-Free Optimization
cites work: MultiGLODS: global and local multiobjective optimization using direct search
cites work: Direct Multisearch for Multiobjective Optimization
cites work: Incorporating minimum Frobenius norm models in direct search
cites work: Theory of Positive Linear Dependence
cites work: Multiobjective optimization using an adaptive weighting scheme
cites work: Benchmarking optimization software with performance profiles.
cites work: A Bayesian approach to constrained single- and multi-objective optimization
cites work: A method for constrained multiobjective optimization based on SQP techniques
cites work: Q4715202
cites work: Q4435425
cites work: A box decomposition algorithm to compute the hypervolume indicator
cites work: A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
cites work: Developments of NEWUOA for minimization without derivatives
cites work: A Derivative-Free Trust-Region Method for Biobjective Optimization
cites work: Algorithm 905
cites work: A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
cites work: Multiple criteria decision analysis. State of the art surveys. In 2 volumes
DOI: 10.1007/S10589-020-00233-8
Recommended article: Direct Multisearch for Multiobjective Optimization
Recommended article: Multiple-objective programming with polynomial objectives and constraints
Recommended article: The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems
Recommended article: Q3059324
Recommended article: Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
Recommended article: On the extension of the \textsc{direct} algorithm to multiple objectives
Recommended article: A modified direction approach for proper efficiency of multiobjective optimization
Recommended article: Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications
Recommended article: Multi-objective convex polynomial optimization and semidefinite programming relaxations
Recommended article: A direct approach for finding all efficient solutions for multiobjective programming problems
description: scientific article; zbMATH DE number 7342443