Results 11 to 20 of about 9,856 (164)
Journal of MathematicsData completion techniques offer numerous advantages in various fields. However, completing large datasets that must satisfy specific criteria can be challenging, necessitating the use of approximative completion methods.
Hajar A. Alshaikh +2 more
doaj +2 more sources
Applied Sciences, 2020 This paper deals with a classical problem in power system analysis regarding the optimal location and sizing of distributed generators (DGs) in direct current (DC) distribution networks using the mathematical optimization.
Walter Gil-González +3 more
doaj +1 more source
On the Embed and Project Algorithm for the Graph Bandwidth Problem
Mathematics, 2021 The graph bandwidth problem, where one looks for a labeling of graph vertices that gives the minimum difference between the labels over all edges, is a classical NP-hard problem that has drawn a lot of attention in recent decades. In this paper, we focus
Janez Povh
doaj +1 more source
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
EURO Journal on Computational Optimization, 2019 We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of the weights of the edges joining vertices in different subsets is maximized.
VilmarJefté Rodrigues de Sousa +2 more
doaj +1 more source
Semidefinite Programming Algorithms for 3-D AOA-Based Hybrid Localization
IEEE Open Journal of Signal Processing, 2023 By taking different kinds of measurements at the same time, it may be possible to improve the accuracy of target localization or reduce the number of sensors needed.
Yanbin Zou
doaj +1 more source
Faster quantum and classical SDP approximations for quadratic binary optimization [PDF]
Quantum, 2022 We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. This class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum
Fernando G.S L. Brandão +2 more
doaj +1 more source
Variational density matrix optimization using semidefinite programming [PDF]
, 2011 We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to matrix ...
Boyd +22 more
core +2 more sources
Array pattern synthesis using semidefinite programming and a bisection method
ETRI Journal, 2019 In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank‐one ...
Jong‐Ho Lee +3 more
doaj +1 more source
Exact duality in semidefinite programming based on elementary reformulations [PDF]
, 2015 In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite system of the ...
Liu, Minghui, Pataki, Gabor
core +3 more sources
Alternative SDP and SOCP approximations for polynomial optimization
EURO Journal on Computational Optimization, 2019 In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP).
Xiaolong Kuang +3 more
doaj +1 more source