Improving the identification of general Pareto fronts by global optimization

DOI10.1016/j.crma.2009.01.020zbMath1157.93005OpenAlexW2062617645MaRDI QIDQ1009544

Bijan Mohammadi, Patrick Redont

Publication date: 2 April 2009

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2009.01.020

zbMATH Keywords

controllabilitymulti-criteria problemssecond-order dynamic system

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Controllability (93B05) System identification (93B30) Control/observation systems governed by ordinary differential equations (93C15)

Related Items (3)

Numerical upper bounds on growth of automaton groups ⋮ Uncertainty quantification in littoral erosion ⋮ Value at risk for confidence level quantifications in robust engineering optimization

Uses Software

• NBI

Cites Work

• Optimal transport, shape optimization and global minimization
• A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
• Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
• Semideterministic global optimization method: Application to a control problem of the Burgers equation
• Semi-deterministic and genetic algorithms for global optimization of microfluidic protein-folding devices
• Applied Shape Optimization for Fluids
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

This page was built for publication: Improving the identification of general Pareto fronts by global optimization