New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
From MaRDI portal
Publication:3177615
Recommendations
- Generalized set order relations and their numerical treatment
- Numerical procedures in multiobjective optimization with variable ordering structures
- An interactive algorithm for nonlinear vector optimization
- Graef-Younes method with backward iteration
- On an algorithm for solving a linear vector optimization problem
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3525703 (Why is no real title available?)
- scientific article; zbMATH DE number 2067641 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (Why is no real title available?)
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Complete efficiency and interdependencies between objective functions in vector optimization
- Cones and duality
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples.
- Covering Pareto sets by multilevel subdivision techniques
- Explicitly quasiconvex set-valued optimization
- GPU implementation of a multiobjective search algorithm
- Graef-Younes method with backward iteration
- Introducing oblique norms into multiple criteria programming
- Multiobjective bilevel optimization
- Multiobjective search algorithm with subdivision technique
- Nonconvex separation theorems and some applications in vector optimization
- On Finding the Maxima of a Set of Vectors
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
- On the effects of combining objectives in multi-objective optimization
- Sets and ordered structures
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- Variational methods in partially ordered spaces
- Vector Optimization
- Vector optimization in medical engineering
Cited in
(6)- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
- A general branch-and-bound framework for continuous global multiobjective optimization
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Graef-Younes method with backward iteration
- Vectorial penalisation in vector optimisation in real linear-topological spaces
This page was built for publication: New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177615)
