A complementarity constraint formulation of convex multiobjective optimization problems
From MaRDI portal
(Redirected from Publication:2901064)
Recommendations
- Conjugate duality for multiobjective composed optimization problems
- Convex composite multi-objective nonsmooth programming
- New constrained optimization reformulation of complementarity problems
- Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
- On generalized-convex constrained multi-objective optimization
- Multiobjective programming problems under generalized convexity
- A constraint method in nonlinear multi-objective optimization
- An approximation algorithm for convex multi-objective programming problems
- scientific article; zbMATH DE number 778346
- scientific article; zbMATH DE number 4119966
Cited in
(7)- Multiple reduced gradient method for multiobjective optimization problems
- Bilevel programming for generating discrete representations in multiobjective optimization
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Engine calibration: multi-objective constrained optimization of engine maps
- Equispaced Pareto front construction for constrained bi-objective optimization
- Generating equidistant representations in biobjective programming
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
This page was built for publication: A complementarity constraint formulation of convex multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901064)
