A spectral approach to solve box-constrained multi-objective optimization problems
From MaRDI portal
Recommendations
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- A path following method for box-constrained multiobjective optimization with applications to goal programming problems
- Explicit gradient information in multiobjective optimization
- scientific article; zbMATH DE number 2143163
- Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints
Cited in
(5)- A path following method for box-constrained multiobjective optimization with applications to goal programming problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Explicit gradient information in multiobjective optimization
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
This page was built for publication: A spectral approach to solve box-constrained multi-objective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437616)
