A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
From MaRDI portal
Publication:3112505
DOI10.1080/02331934.2011.587006zbMath1232.65086OpenAlexW2022908021MaRDI QIDQ3112505
Publication date: 10 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://ap01.alma.exlibrisgroup.com/view/delivery/61USOUTHAUS_INST/12142954320001831
algorithmsnonsmooth optimizationmulti-objective optimizationnonconvex optimizationscalarizationefficient setPareto front
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items (17)
On high-order model regularization for multiobjective optimization ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality ⋮ An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization ⋮ Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach ⋮ A combined scalarization method for multi-objective optimization problems ⋮ A numerical method for constructing the Pareto front of multi-objective optimization problems ⋮ A new approach to approximate the bounded Pareto front ⋮ Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ A numerical method for nonconvex multi-objective optimal control problems ⋮ Optimization over the Pareto front of nonconvex multi-objective optimal control problems ⋮ A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ Multi-objective optimization using statistical models ⋮ Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization ⋮ Evolutionary search with multiple utopian reference points in decomposition-based multiobjective optimization ⋮ A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
Uses Software
Cites Work
- Optimization over the efficient set of multi-objective convex optimal control problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Scalarizations for adaptively solving multi-objective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Generating the weakly efficient set of nonconvex multiobjective problems
- An inexact modified subgradient algorithm for nonconvex optimization
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization
- Finding preferred subsets of Pareto optimal solutions
- An update rule and a convergence result for a penalty function method
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Adaptive Scalarization Methods in Multiobjective Optimization
- Newton's Method for Multiobjective Optimization
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- Multiobjective Optimization Through a Series of Single-Objective Formulations
- An Adaptive Scalarization Method in Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Comments on properties of the minmax solutions in goal programming
This page was built for publication: A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
