A new scalarization technique and new algorithms to generate Pareto fronts
From MaRDI portal
Publication:5266532
Recommendations
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Modification of some scalarization approaches for multiobjective optimization
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- A mesh adaptive direct search algorithm for multiobjective optimization
- A new approach to approximate the bounded Pareto front
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A numerical method for nonconvex multi-objective optimal control problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Improved -constraint method for multiobjective programming
- Multicriteria Optimization
- Multiobjective Optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Nonlinear multiobjective optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization over the efficient set of multi-objective convex optimal control problems
- Response surface approximation of Pareto optimal front in multi-objective optimization
- Scalarizations for adaptively solving multi-objective optimization problems
- Scalarizing vector optimization problems
- Set-valued optimization. An introduction with applications
- Survey of multi-objective optimization methods for engineering
- Vector Optimization
- Vector optimization. Set-valued and variational analysis.
Cited in
(32)- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Bi-objective design-for-control of water distribution networks with global bounds
- On the use of polynomial models in multiobjective directional direct search
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Strong and weak conditions of regularity and optimality
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- An approximation algorithm for multiobjective mixed-integer convex optimization
- A norm minimization-based convex vector optimization algorithm
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- Combined gradient methods for multiobjective optimization
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Solving multiobjective mixed integer convex optimization problems
- A modified direction approach for proper efficiency of multiobjective optimization
This page was built for publication: A new scalarization technique and new algorithms to generate Pareto fronts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266532)
