A note on completely positive relaxations of quadratic problems in a multiobjective framework
DOI10.1007/S10898-021-01091-2zbMATH Open1486.90172OpenAlexW3207466956MaRDI QIDQ2114601FDOQ2114601
Authors: Gabriele Eichfelder, Patrick Groetzner 
Publication date: 15 March 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01091-2
Recommendations
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
Quadratic programming (90C20) Multi-objective and goal programming (90C29) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Theory of multiobjective optimization
- Title not available (Why is that?)
- Multicriteria Optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- On the Matrix Equation X′X = A
- Title not available (Why is that?)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Factorization and cutting planes for completely positive matrices by copositive projection
- On the computational complexity of membership problems for the completely positive cone and its dual
- Copositive optimization -- recent developments and applications
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
- A factorization method for completely positive matrices
Cited In (4)
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Computing the recession cone of a convex upper image via convex projection
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
This page was built for publication: A note on completely positive relaxations of quadratic problems in a multiobjective framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114601)
