Gap-free computation of Pareto-points by quadratic scalarizations
DOI10.1007/S001860300316zbMATH Open1131.90054OpenAlexW2166028622MaRDI QIDQ1880263FDOQ1880263
Authors: Jörg Fliege 
Publication date: 22 September 2004
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860300316
Recommendations
- Computation of robust Pareto points
- A new scalarization technique and new algorithms to generate Pareto fronts
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Quadratic scalarization for decomposed multiobjective optimization
- Approximating Pareto curves using semidefinite relaxations
- scientific article; zbMATH DE number 1975082
- Quadratic programming and scalable algorithms for variational inequalities
- Regularization of the vector problem with quadratic criteria of Pareto optimization
- Tracing locally Pareto-optimal points by numerical integration
- Approximation of a set of Pareto-optimal solutions
Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Cited In (25)
- Optimality conditions in nondifferentiable fuzzy optimization
- A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems
- Multicriteria optimization with a multiobjective golden section line search
- Multiobjective bilevel optimization
- An optimal alternative theorem and applications to mathematical programming
- Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques
- A method for constrained multiobjective optimization based on SQP techniques
- On the calculation of a membership function for the solution of a fuzzy linear optimization problem
- Solving bilevel programming problems with multicriteria optimization techniques
- An Image Set-Oriented Method for the Numerical Treatment of Bi-Level Multi-objective Optimization Problems
- A memetic variant of R-NSGA-II for reference point problems
- A semidefinite programming approach for solving multiobjective linear programming
- Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
- A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
- On the quality of discrete representations in multiple objective programming
- Stochastic multiobjective optimization: Sample average approximation and applications
- Generating equidistant representations in biobjective programming
- Multicriteria approach to bilevel optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- Robust multiobjective optimization \& applications in portfolio optimization
- A deterministic algorithm for global multi-objective optimization
- Parallel Cell Mapping for Unconstrained Multi-Objective Optimization Problems
- Quasi-Newton methods for multiobjective optimization problems
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm
Uses Software
This page was built for publication: Gap-free computation of Pareto-points by quadratic scalarizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880263)
