Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
From MaRDI portal
Publication:380592
DOI10.3934/jimo.2014.10.543zbMath1281.90047arXiv1211.4670OpenAlexW2964001118MaRDI QIDQ380592
Publication date: 14 November 2013
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.4670
quadratic programmingcopositive programmingmultiple objective programmingcompletely positive programminglinear weighted sum method
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Numerical methods of relaxation type (49M20)
Related Items (4)
Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ A new approach for uncertain multiobjective programming problem based on \(\mathcal{P}_{E}\) principle ⋮ Bilevel multi-objective construction site security planning with twofold random phenomenon ⋮ A note on completely positive relaxations of quadratic problems in a multiobjective framework
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weighted sum method for multi-objective optimization: new insights
- Copositive optimization -- recent developments and applications
- Nonsmooth optimization over the (weakly or properly) Pareto set of a linear-quadratic multi-objective control problem: explicit optimality conditions
- A class of stochastic optimization problems with one quadratic \& several linear objective functions and extended portfolio selection model
- On fuzzy random multiobjective quadratic programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A reference direction approach to multiple objective quadratic-linear programming
- The maximal cp-rank of rank \(k\) completely positive matrices
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
This page was built for publication: Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems