New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
DOI10.1080/02331934.2018.1474469zbMATH Open1402.90167OpenAlexW2803436550WikidataQ129806114 ScholiaQ129806114MaRDI QIDQ3177615FDOQ3177615
Publication date: 1 August 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1474469
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
partially ordered spacedomination propertyminimal elementcone-monotone functionGraef-Younes reduction methodmultiobjective subdivision technique
Cites Work
- Convex Analysis
- Variational methods in partially ordered spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiobjective bilevel optimization
- Explicitly quasiconvex set-valued optimization
- Vector Optimization
- Cones and duality
- Nonconvex separation theorems and some applications in vector optimization
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
- GPU implementation of a multiobjective search algorithm
- On Finding the Maxima of a Set of Vectors
- Multiobjective search algorithm with subdivision technique
- Convex analysis and nonlinear optimization. Theory and examples.
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Title not available (Why is that?)
- Covering Pareto sets by multilevel subdivision techniques
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- Title not available (Why is that?)
- Graef-Younes method with backward iteration
- On the effects of combining objectives in multi-objective optimization
- Complete efficiency and interdependencies between objective functions in vector optimization
- Vector Optimization in Medical Engineering
- Introducing oblique norms into multiple criteria programming
- Sets and ordered structures
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
Uses Software
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)