Results 41 to 50 of about 113,518 (248)

An accelerated proximal augmented Lagrangian method and its application in compressive sensing

Journal of Inequalities and Applications, 2017
As a first-order method, the augmented Lagrangian method (ALM) is a benchmark solver for linearly constrained convex programming, and in practice some semi-definite proximal terms are often added to its primal variable’s subproblem to make it more ...
Min Sun, Jing Liu
doaj   +1 more source

Semi-Definite Programming for Real Root Finding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2010
In this Letter, we explore semi-definite relaxation (SDR) program for finding the real roots of a real polynomial. By utilizing the square of the polynomial, the problem is approximated using the convex optimization framework and a real root is estimated from the corresponding minimum point.
LUI, Kenneth Wing Kin, SO, Hing Cheung
openaire   +1 more source

Aggregating distributed energy resources for grid flexibility services: A distributed game theoretic approach

International Journal of Robust and Nonlinear Control, EarlyView., 2023
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen, Mehran Shakarami, Jacquelien M. A. Scherpen, Nima Monshizadeh   +3 more
wiley   +1 more source

Achievable Rate Region under Linear Beamforming for Dual-Hop Multiple-Access Relay Network

Entropy, 2018
Consider a network consisting of two independent single-antenna sources, a single-antenna destination and a helping multiple-antenna relay. This network is called a dual-hop multiple access relay network (MARN).
Guiguo Feng, Wangmei Guo, Binyue Liu
doaj   +1 more source

Semi-Definite Relaxation-Based ADMM for Cooperative Planning and Control of Connected Autonomous Vehicles [PDF]

IEEE transactions on intelligent transportation systems (Print), 2021
This paper investigates the cooperative planning and control problem for multiple connected autonomous vehicles (CAVs) in different scenarios. In the existing literature, most of the methods suffer from significant problems in computational efficiency ...
Xiaoxue Zhang, Zilong Cheng, Jun Ma, Sunan Huang, F. Lewis, Tong-heng Lee   +5 more
semanticscholar   +1 more source

Method for TDOA localisation in over-the-horizon environments

The Journal of Engineering, 2019
Here, the authors propose a new over-the-horizon time-difference-of-arrival localisation model based on the ground-wave and simultaneously put forward a modified semi-definite programming algorithm, which is called Ground-wave semi-definite programming ...
Jian-Xin Liu, Xing-Peng Mao
doaj   +1 more source

Optimal power flow of MT‐HVDC system connected large offshore wind farms using mixed‐integer semi‐definite programming approach

IET Generation, Transmission & Distribution, 2021
Typically offshore wind farms are connected to the onshore AC grid networks using voltage source converter based MT‐HVDC networks. This article aims to formulating optimal power flow (OPF) problem of MT‐HVDC system connected large offshore wind farms ...
Nikhil Pathak, Zechun Hu
doaj   +1 more source

Mutually unbiased bases and semi-definite programming

Journal of Physics: Conference Series, 2010
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Grobner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased
Weigert, Stefan, Brierley, Steve
openaire   +4 more sources

A distributionally robust optimization approach for two-stage facility location problems

EURO Journal on Computational Optimization, 2020
In this paper, we consider a facility location problem where customer demand constitutes considerable uncertainty, and where complete information on the distribution of the uncertainty is unavailable.
Arash Gourtani, Tri-Dung Nguyen, Huifu Xu   +2 more
doaj   +1 more source

BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD [PDF]

International Journal of Quantum Information, 2004
The present methods for obtaining the optimal Lewenestein–Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein–Sanpera decomposition by using semi-definite programming.
Jafarizadeh, M. A., Mirzaee, M., Rezaee, M.   +2 more
openaire   +3 more sources