On linear and semidefinite programming relaxations for hypergraph matching

Mathematical Programming ◽

10.1007/s10107-011-0451-5 ◽

2011 ◽

Vol 135 (1-2) ◽

pp. 123-148 ◽

Author(s):

Yuk Hei Chan ◽

Lap Chi Lau

Keyword(s):

Semidefinite Programming ◽

Hypergraph Matching ◽

Semidefinite Programming Relaxations

Download Full-text

On Linear and Semidefinite Programming Relaxations for Hypergraph Matching

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973075.122 ◽

2010 ◽

Author(s):

Yuk Hei Chan ◽

Lap Chi Lau

Keyword(s):

Semidefinite Programming ◽

Hypergraph Matching ◽

Semidefinite Programming Relaxations

Download Full-text

On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems

Handbook of Approximation Algorithms and Metaheuristics - Chapman & Hall/CRC Computer & Information Science Series ◽

10.1201/9781420010749.ch8 ◽

2007 ◽

pp. 8-1-8-16

Author(s):

Jiawei Zhang ◽

Yinyu Ye ◽

Anthony Man-Cho So

Keyword(s):

Semidefinite Programming ◽

Optimization Problems ◽

Quadratic Optimization ◽

Semidefinite Programming Relaxations

Download Full-text

Approximating the 2-catalog segmentation problem using semidefinite programming relaxations

Optimization Methods and Software ◽

10.1080/10556780310001634082 ◽

2003 ◽

Vol 18 (6) ◽

pp. 705-719 ◽

Author(s):

Dachuan Xu* ◽

Yinyu Ye ◽

Jiawei Zhang‡

Keyword(s):

Semidefinite Programming ◽

Semidefinite Programming Relaxations ◽

Segmentation Problem

Download Full-text

Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM ◽

10.1145/375827.375840 ◽

2001 ◽

Vol 48 (2) ◽

pp. 206-242 ◽

Author(s):

Martin Skutella

Keyword(s):

Semidefinite Programming ◽

Semidefinite Programming Relaxations

Download Full-text

New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem

Discrete Applied Mathematics ◽

10.1016/j.dam.2016.07.013 ◽

2017 ◽

Vol 217 ◽

pp. 19-39 ◽

Author(s):

Philipp Hungerländer

Keyword(s):

Semidefinite Programming ◽

Traveling Salesman Problem ◽

Traveling Salesman ◽

Linear Ordering ◽

Semidefinite Programming Relaxations ◽

The Traveling Salesman Problem

Download Full-text

Properties of dimension witnesses and their semidefinite programming relaxations

Physical Review A ◽

10.1103/physreva.90.022322 ◽

2014 ◽

Vol 90 (2) ◽

Author(s):

Piotr Mironowicz ◽

Hong-Wei Li ◽

Marcin Pawłowski

Keyword(s):

Semidefinite Programming ◽

Semidefinite Programming Relaxations

Download Full-text

A note on semidefinite programming relaxations for polynomial optimization over a single sphere

Science China Mathematics ◽

10.1007/s11425-016-0301-5 ◽

2016 ◽

Vol 59 (8) ◽

pp. 1543-1560 ◽

Author(s):

Jiang Hu ◽

Bo Jiang ◽

Xin Liu ◽

ZaiWen Wen

Keyword(s):

Semidefinite Programming ◽

Polynomial Optimization ◽

Single Sphere ◽

Semidefinite Programming Relaxations

Download Full-text

Semidefinite programming relaxations for {0,1}-power dispatch problems

199 IEEE Power Engineering Society Summer Meeting. Conference Proceedings (Cat. No.99CH36364) ◽

10.1109/pess.1999.787402 ◽

2003 ◽

Author(s):

M. Madrigal ◽

A.D. Quintana

Keyword(s):

Semidefinite Programming ◽

Power Dispatch ◽

Semidefinite Programming Relaxations

Download Full-text

A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow

Optimization Methods and Software ◽

10.1080/10556788.2017.1288729 ◽

2017 ◽

Vol 32 (4) ◽

pp. 849-871 ◽

Author(s):

Jakub Mareček ◽

Martin Takáč

Keyword(s):

Semidefinite Programming ◽

Optimal Power Flow ◽

Coordinate Descent ◽

Low Rank ◽

Descent Algorithm ◽

Coordinate Descent Algorithm ◽

Optimal Power ◽

Semidefinite Programming Relaxations

Download Full-text

Semidefinite Programming Relaxations Applied to Determining Upper Bounds of C-numerical Ranges

2006 IEEE International Conference on Control Applications ◽

10.1109/cca.2006.285999 ◽

2006 ◽

Author(s):

Bernd Tibken ◽

Youping Fan ◽

Steffen Glaser ◽

Thomas Schulte-Herbruggen

Keyword(s):

Semidefinite Programming ◽

Upper Bounds ◽

Semidefinite Programming Relaxations

Download Full-text