A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
From MaRDI portal
Publication:467443
DOI10.1007/s10957-013-0346-0zbMath1298.90091OpenAlexW2078040808WikidataQ58048414 ScholiaQ58048414MaRDI QIDQ467443
M. M. Rizvi, C. Yalçın Kaya, Regina Sandra Burachik
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://ap01.alma.exlibrisgroup.com/view/delivery/61USOUTHAUS_INST/12153803600001831
numerical methodsmultiobjective optimizationefficient setPareto frontdisconnected feasible setscalarization techniques
Related Items
On high-order model regularization for multiobjective optimization ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization ⋮ Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach ⋮ Efficient algorithms for solving nonlinear fractional programming problems ⋮ 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 combined scalarization method for multi-objective optimization problems ⋮ 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 ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach ⋮ 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 ⋮ Unnamed Item ⋮ Solving Multiobjective Mixed Integer Convex 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 ⋮ Necessary optimality conditions for a semivectorial bilevel problem under a partial calmness condition ⋮ Comparison of some scalarization methods in multiobjective optimization ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint ⋮ Unnamed Item ⋮ Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ A New Scalarization Technique and New Algorithms to Generate Pareto Fronts ⋮ The modified objective-constraint scalarization approach for multiobjective optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Survey of multi-objective optimization methods for engineering
- Optimization over the efficient set of multi-objective convex optimal control problems
- Scalarizations for adaptively solving multi-objective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- A method for convex curve approximation
- Nonlinear multiobjective optimization
- Scalarizing vector optimization problems
- Approximation methods for non-convex curves
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Proper efficiency and the theory of vector maximization
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- An Adaptive Scalarization Method in Multiobjective Optimization
- The Vector Maximization Problem: Proper Efficiency and Stability
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Multiobjective Optimization
- Algorithms for the vector maximization problem
- Multicriteria Optimization
- Optimization over the efficient set
- Optimization over the efficient set
