A sequential approach for unconstrained optimization via a partitioning technique
From MaRDI portal
Publication:5259072
Recommendations
- scientific article; zbMATH DE number 4128663
- scientific article; zbMATH DE number 6183018
- A General-Purpose Parallel Algorithm for Unconstrained Optimization
- A multivariate partition approach to optimization problems
- A partitioned PSB method for partially separable unconstrained optimization problems
- Parallel algorithm for unconstrained optimization based on decomposition techniques
- Efficient interval partitioning for constrained global optimization
- scientific article; zbMATH DE number 3994937
- scientific article; zbMATH DE number 3898623
Cites work
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 976350 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- A lexicographic optimization algorithm
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Generalized descent for global optimization
- Nonlinear multiobjective optimization
- On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
- Properties of efficient solution sets under addition of objectives
- Survey of multi-objective optimization methods for engineering
Cited in
(2)
This page was built for publication: A sequential approach for unconstrained optimization via a partitioning technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259072)