Optimizing over the properly efficient set of convex multi-objective optimization problems
From MaRDI portal
Publication:828826
Recommendations
- On characterizations of proper efficiency for nonconvex multiobjective optimization
- scientific article; zbMATH DE number 7366571
- Optimization over the efficient set of multi-objective convex optimal control problems
- Solving Optimization Problems over the Weakly Efficient Set
- Enhanced efficiency in multi-objective optimization
Cites work
- scientific article; zbMATH DE number 4207214 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A Frank--Wolfe type theorem for convex polynomial programs
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- A convex-concave programming method for optimizing over the efficient set.
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A novel penalty function method for semivectorial bilevel programming problem
- A solution method for semivectorial bilevel programming problem via penalty method
- A survey of recent developments in multiobjective optimization
- Algorithms for the vector maximization problem
- An algorithm for optimizing over the weakly-efficient set
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An exact method for computing the nadir values in multiple objective linear programming
- An exact penalty on bilevel programs with linear vector optimization lower level
- An inner approximation method for optimization over the weakly efficient set
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- An upper bound on properly efficient solutions in multiobjective optimization
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Benson type algorithms for linear vector optimization and applications
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Conical algorithm in global optimization for optimizing over efficient sets
- Dual approach to minimization on the set of Pareto-optimal solutions
- Graph implementations for nonsmooth convex programs
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- Maximizing a concave function over the efficient or weakly-efficient set
- Minimization of a quasi-concave function over an efficient set
- Minimum maximal flow problem: An optimization over the efficient set
- Multicriteria Optimization
- Multiple criteria linear programming model for portfolio selection
- Nonlinear multiobjective optimization
- Numerical Optimization
- Optimization on low rank nonconvex structures
- Optimization over the efficient set
- Optimization over the efficient set using an active constraint approach
- Optimization over the efficient set: overview
- Optimization under composite monotonic constraints and constrained optimization over the efficient set
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Optimizing a linear function over an efficient set
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Primal and dual algorithms for optimization over the efficient set
- Problems with resource allocation constraints and optimization over the efficient set
- Proper efficiency and the theory of vector maximization
- Pénalisation dans l'optimisation sur l'ensemble faiblement efficient
- Reverse polyblock approximation for optimization over the weakly efficient set and efficient set.
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semivectorial bilevel optimization problem: penalty approach
- Solving semidefinite-quadratic-linear programs using SDPT3
- Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection
- The maximization of a function over the efficient set via a penalty function approach
Cited in
(16)- Computing Convex Coverage Sets for Faster Multi-objective Coordination
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Performance optimization over positive \(l_\infty\) cones
- A graphical characterization of the efficient set for convex multiobjective problems
- Optimization over the efficient set using an active constraint approach
- On generalized-convex constrained multi-objective optimization
- Optimization over the efficient set of multi-objective convex optimal control problems
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- An upper bound on properly efficient solutions in multiobjective optimization
- On optimization over the efficient set of a multiple objective linear programming problem
- Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis
- Separations and optimality of constrained multiobjective optimization via improvement sets
- An equivalent transformation of multi-objective optimization problems
- Weighted Multidimensional Search and Its Application to Convex Optimization
- scientific article; zbMATH DE number 6612741 (Why is no real title available?)
- Bi-objective optimisation over a set of convex sub-problems
This page was built for publication: Optimizing over the properly efficient set of convex multi-objective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828826)
