Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Simplified semidefinite and completely positive relaxations

From MaRDI portal
Publication:1785437
Jump to:navigation, search

DOI10.1016/j.orl.2015.09.001zbMath1408.90229OpenAlexW1879219441MaRDI QIDQ1785437

Felix Lieder

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.09.001


zbMATH Keywords

completely positivequadratic programbinarysemidefinite


Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20)


Related Items (2)

A simplified completely positive reformulation for binary quadratic programs ⋮ Completely positive and copositive program modelling for quadratic optimization problems


Uses Software

  • SDPT3
  • YALMIP


Cites Work

  • Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
  • On the copositive representation of binary and continuous nonconvex quadratic programs
  • SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
  • Unnamed Item


This page was built for publication: Simplified semidefinite and completely positive relaxations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1785437&oldid=14135464"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki