Cutting Planes for Mixed 0-1 Semidefinite Programs

2001 ◽  
pp. 251-263 ◽  
Author(s):  
G. Iyengar ◽  
M. T. Çezik
Keyword(s):  
Cutting Planes ◽  
Semidefinite Programs

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

1998 ◽  
Vol 82 (3) ◽  
pp. 291-315 ◽  
Author(s):  
Christoph Helmberg ◽  
Franz Rendl
Keyword(s):  
Cutting Planes ◽  
Semidefinite Programs

scholarly journals Jordan products of quantum channels and their compatibility

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Mark Girard ◽  
Martin Plávala ◽  
Jamie Sikora
Keyword(s):  
Quantum State ◽  
Sufficient Conditions ◽  
The Other ◽  
Independent Interest ◽  
Quantum Channels ◽  
Semidefinite Programs ◽  
Jordan Product ◽  
Marginal Problem ◽  
Jordan Products ◽  
Product Of Matrices

AbstractGiven two quantum channels, we examine the task of determining whether they are compatible—meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting the output of the other channel). Here, we present several results concerning this task. First, we show it is equivalent to the quantum state marginal problem, i.e., every quantum state marginal problem can be recast as the compatibility of two channels, and vice versa. Second, we show that compatible measure-and-prepare channels (i.e., entanglement-breaking channels) do not necessarily have a measure-and-prepare compatibilizing channel. Third, we extend the notion of the Jordan product of matrices to quantum channels and present sufficient conditions for channel compatibility. These Jordan products and their generalizations might be of independent interest. Last, we formulate the different notions of compatibility as semidefinite programs and numerically test when families of partially dephasing-depolarizing channels are compatible.

Cutting planes for mixed-integer knapsack polyhedra

1998 ◽  
Vol 81 (2) ◽  
pp. 257-262 ◽  
Author(s):  
Xiao-Qing Yan ◽  
E. Andrew Boyd
Keyword(s):  
Cutting Planes ◽  
Mixed Integer

Computational Experience with Applications of Bilinear Cutting Planes

2013 ◽  
Vol 52 (22) ◽  
pp. 7514-7525 ◽  
Author(s):  
Keith Zorn ◽  
Nikolaos V. Sahinidis
Keyword(s):  
Cutting Planes ◽  
Computational Experience

Study about the Stone Curves and the Development of Polygonal Shape Cutting Device

2014 ◽  
Vol 1025-1026 ◽  
pp. 85-88 ◽  
Author(s):  
Sung Hoon Oh
Keyword(s):  
Cutting Planes ◽  
Working Time ◽  
Path Generation ◽  
Control Module ◽  
Positioning Control ◽  
Large Size ◽  
Design Program ◽  
Polygonal Shape ◽  
The Temple

Through this study, equipment was developed which could work large size stones into linear and curve shaped cutting planes and cut polygonal shaped stones during the lapping and semi-finishing works which are pre-tasks to manufacture the large size building column or large size stone statue which is installed in the temple. The best is to read these instructions and follow the outline of this text. Safety of equipment could be secured using design program and structure interpreting program and productivity could be improved by reducing the required manpower and working time for rough grinding and semi-finishing works through positioning control module. This technology is expected to be utilized in manufacturing various stone equipments by applying the working path generation and oil pressure technologies as the type of NC work equipments as well as in future working area.

Strong lift-and-project cutting planes for the stable set problem

2012 ◽  
Vol 141 (1-2) ◽  
pp. 165-192 ◽  
Author(s):  
Monia Giandomenico ◽  
Fabrizio Rossi ◽  
Stefano Smriglio
Keyword(s):  
Cutting Planes ◽  
Stable Set ◽  
Strong Lift ◽  
Stable Set Problem

scholarly journals An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers

2012 ◽  
Vol 2012 ◽  
pp. 1-21 ◽  
Author(s):  
John Machacek ◽  
Shafiu Jibrin
Keyword(s):  
Newton’S Method ◽  
Interior Point ◽  
Newton's Method ◽  
Interior Point Method ◽  
Optimal Solution ◽  
Point Method ◽  
Feasible Region ◽  
Test Problems ◽  
Analytic Centers ◽  
Semidefinite Programs

We investigate solving semidefinite programs (SDPs) with an interior point method called SDP-CUT, which utilizes weighted analytic centers and cutting plane constraints. SDP-CUT iteratively refines the feasible region to achieve the optimal solution. The algorithm uses Newton’s method to compute the weighted analytic center. We investigate different stepsize determining techniques. We found that using Newton's method with exact line search is generally the best implementation of the algorithm. We have also compared our algorithm to the SDPT3 method and found that SDP-CUT initially gets into the neighborhood of the optimal solution in less iterations on all our test problems. SDP-CUT also took less iterations to reach optimality on many of the problems. However, SDPT3 required less iterations on most of the test problems and less time on all the problems. Some theoretical properties of the convergence of SDP-CUT are also discussed.

Sign in / Sign up

Export Citation Format

Share Document