A note on completely positive relaxations of quadratic problems in a multiobjective framework

DOI10.1007/s10898-021-01091-2zbMath1486.90172OpenAlexW3207466956MaRDI QIDQ2114601

Patrick Groetzner, Gabriele Eichfelder

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

zbMATH Keywords

quadratic programmingmultiobjective optimizationconvexificationcompletely positive optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (1)

Twenty years of continuous multiobjective optimization in the twenty-first century

Cites Work

• Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
• Copositive optimization -- recent developments and applications
• On the computational complexity of membership problems for the completely positive cone and its dual
• Theory of multiobjective optimization
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• A factorization method for completely positive matrices
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Factorization and cutting planes for completely positive matrices by copositive projection
• Approximation of the Stability Number of a Graph via Copositive Programming
• On the Matrix Equation X′X = A
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on completely positive relaxations of quadratic problems in a multiobjective framework