Results 11 to 20 of about 33,460 (204)
Enhancing pseudo-telepathy in the magic square game. [PDF]
PLoS ONE, 2013 We study the possibility of reversing an action of a quantum channel. Our principal objective is to find a specific channel that reverses as accurately as possible an action of a given quantum channel. To achieve this goal we use semidefinite programming.
Lukasz Pawela +3 more
doaj +1 more source
Invariant Semidefinite Programs [PDF]
, 2011 In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and applications. The purpose of this handbook chapter is to give the reader the necessary background for dealing with ...
Bachoc, C. +3 more
openaire +3 more sources
Open Journal of Mathematical Optimization, 2022 We address the issue of computing a global minimizer of the AC Optimal Power Flow problem. We introduce valid inequalities to strengthen the Semidefinite Programming relaxation, yielding a novel Conic Programming relaxation.
Oustry, Antoine
doaj +1 more source
A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
Journal of Inequalities and Applications, 2019 In this paper, we present a sequential semidefinite programming (SSDP) algorithm for nonlinear semidefinite programming. At each iteration, a linear semidefinite programming subproblem and a modified quadratic semidefinite programming subproblem are ...
Jian Ling Li, Hui Zhang
doaj +1 more source
Semidefinite Programming and Ramsey Numbers [PDF]
SIAM Journal on Discrete Mathematics, 2021 Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, so it seems that the method is not suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper.
Bernard Lidický, Florian Pfender
openaire +4 more sources
Entropy-Penalized Semidefinite Programming [PDF]
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019 Low-rank methods for semi-definite programming (SDP) have gained a lot of interest recently, especially in machine learning applications. Their analysis often involves determinant-based or Schatten-norm penalties, which are difficult to implement in practice due to high computational efforts.
Krechetov, Mikhail +3 more
openaire +2 more sources
Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [PDF]
Quantum, 2023 Semidefinite programs are optimization methods with a wide array of applications, such as approximating difficult combinatorial problems. One such semidefinite program is the Goemans-Williamson algorithm, a popular integer relaxation technique.
Taylor L. Patti +3 more
doaj +1 more source
Efficient Semidefinite Programming with Approximate ADMM [PDF]
Journal of Optimization Theory and Applications, 2021 AbstractTenfold improvements in computation speed can be brought to the alternating direction method of multipliers (ADMM) for Semidefinite Programming with virtually no decrease in robustness and provable convergence simply by projecting approximately to the Semidefinite cone.
Rontsis, N, Goulart, P, Nakatsukasa, Y
openaire +2 more sources
A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming
Mathematics, 2023 We investigate a class of challenging general semidefinite programming problems with extra nonconvex constraints such as matrix rank constraints. This problem has extensive applications, including combinatorial graph problems, such as MAX-CUT and ...
Chuangchuang Sun
doaj +1 more source
ON OPTIMUM DESIGN OF FRAME STRUCTURES
Acta Polytechnica CTU Proceedings, 2020 Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality ...
Marek Tyburec +3 more
doaj +1 more source