Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms

DOI10.1007/BF01128945zbMath0899.65041OpenAlexW1980178035MaRDI QIDQ1128397

Marina V. Markina, Roman G. Strongin, Dmitri L. Markin

Publication date: 25 August 1998

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

Full work available at URL: https://doi.org/10.1007/bf01128945

zbMATH Keywords

unconstrained optimizationglobal search algorithmsreduction schemesmulti-extremum optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Global multidimensional optimization on parallel computer
• Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves
• Minimization of multiextremal functions under nonconvex constraints
• Unnamed Item

This page was built for publication: Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms