Quadratic scalarization for decomposed multiobjective optimization
From MaRDI portal
Recommendations
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- Multiobjective optimization involving quadratic functions
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Scalarization and lagrange duality in multiobjective optimization
- A nonlinear scalarization method for multi-objective optimization problems
- Complete scalarization of multi-objective optimization problems
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 1241874 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- A Class of Solutions for Group Decision Problems
- A combined scalarizing method for multiobjective programming problems
- A conic scalarization method in multi-objective optimization
- A modified weighted Tchebycheff metric for multiple objective programming
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A steepest descent method for vector optimization
- A unified vector optimization problem: complete scalarizations and applications
- Adaptive Scalarization Methods in Multiobjective Optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Augmented Lagrangian and Tchebycheff approaches in multiple objective programming
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convexification of a noninferior frontier
- Duality in Vector Optimization
- Existence of efficient solutions for vector maximization problems
- Generating equidistant representations in biobjective programming
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- Multicriteria Optimization
- Multidisciplinary shape optimization in aerodynamics and electromagnetics using genetic algorithms
- Newton's method for multiobjective optimization
- Nonlinear optimization.
- On quadratic scalarization of vector optimization problems in Banach spaces
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency and the theory of vector maximization
- Retrieval and use of the balance set in multiobjective global optimization
- Scalarizing vector optimization problems
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- Set oriented methods for the numerical treatment of multiobjective optimization problems
- Steepest descent methods for multicriteria optimization.
- Weighting factor extensions for finite multiple objective vector minimization problems
Cited in
(2)
This page was built for publication: Quadratic scalarization for decomposed multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331788)
