A Semidefinite Relaxation Method for Elliptical Location
نویسندگان
چکیده
منابع مشابه
A semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملA Local Relaxation Method for Nonlinear Facility Location Problems
A common problem that arises is the number and placement of facilities such as warehouses, manufacturing plants, stores, sensors, etc., needed to provide service to a region. Typically, the greater the number of facilities, the cheaper the cost of providing the service but the higher the capital cost of providing the facilities. The location of a facility is usually limited to a number of fixed...
متن کاملAn Extended Semidefinite Relaxation for Satisfiability
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of partial semidefinite liftings for 0/1 optimization problems. The construction of the relaxation depends on a choice of permutations of the clauses, and different choices may lead to different relaxations. We then consi...
متن کاملQuadratic maximization and semidefinite relaxation
In this paper we study a class of quadratic maximization problems and their semide nite program ming SDP relaxation For a special subclass of the problems we show that the SDP relaxation provides an exact optimal solution Another subclass which is NP hard guarantees that the SDP relaxation yields an approximate solution with a worst case performance ratio of This is a generalization of the well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9010128