Computing the set of optimal points for nonconvex multi-objective optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1784657 (Why is no real title available?)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A conic scalarization method in multi-objective optimization
- A dynamic multiple proximal bundle algorithm for locally Lipschitz multiobjective optimization problems
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An improved definition of proper efficiency for vector maximization with respect to cones
- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- An iterative vertex enumeration method for objective space based vector optimization algorithms
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximation methods in multiobjective programming
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Comparison of some scalarization methods in multiobjective optimization
- Conic scalarization method in multiobjective optimization and relations with other scalarization methods
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Finding all maximal efficient faces in multiobjective linear programming
- Generating the weakly efficient set of nonconvex multiobjective problems
- Globally convergent Newton-type methods for multiobjective optimization
- Multicriteria optimization using a genetic algorithm for determining a Pareto set
- Nonconvex separation theorems and some applications in vector optimization
- Nonlinear multiobjective optimization
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- Proper efficiency with respect to cones
- Reference-point-based branch and bound algorithm for multiobjective optimization
- Scalarizations for adaptively solving multi-objective optimization problems
- Scalarizing vector optimization problems
- The modified subgradient algorithm based on feasible values
- Unbiased approximation in multicriteria optimization
This page was built for publication: Computing the set of optimal points for nonconvex multi-objective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7249667)
