A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
From MaRDI portal
(Redirected from Publication:467443)
Recommendations
- A new scalarization technique and new algorithms to generate Pareto fronts
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- A nonlinear scalarization method for multi-objective optimization problems
- An Adaptive Scalarization Method in Multiobjective Optimization
- The modified objective-constraint scalarization approach for multiobjective optimization problems
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (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 method for convex curve approximation
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- Algorithms for the vector maximization problem
- An Adaptive Scalarization Method in Multiobjective Optimization
- Approximation methods for non-convex curves
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Improved -constraint method for multiobjective programming
- Multicriteria Optimization
- Multiobjective Optimization
- 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
- Optimization over the efficient set
- Optimization over the efficient set
- Optimization over the efficient set of multi-objective convex optimal control problems
- Proper efficiency and the theory of vector maximization
- Scalarizations for adaptively solving multi-objective optimization problems
- Scalarizing vector optimization problems
- Survey of multi-objective optimization methods for engineering
- The Vector Maximization Problem: Proper Efficiency and Stability
Cited in
(36)- On high-order model regularization for multiobjective optimization
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Necessary optimality conditions for a semivectorial bilevel problem under a partial calmness condition
- A numerical method for nonconvex multi-objective optimal control 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
- Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
- An extension of the non-inferior set estimation algorithm for many objectives
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- A weighting subgradient algorithm for multiobjective optimization
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
- A combined scalarization method for multi-objective optimization problems
- 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
- Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
- Quadratic scalarization for decomposed multiobjective optimization
- An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- A new scalarization technique and new algorithms to generate Pareto fronts
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- Inexact proximal point algorithm for multiobjective optimization
- Comparison of some scalarization methods in multiobjective optimization
- Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
- Solving multiobjective mixed integer convex optimization problems
- A nonlinear scalarization method for multi-objective optimization problems
- Efficient algorithms for solving nonlinear fractional programming problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
This page was built for publication: A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467443)
