Results 31 to 40 of about 8,709 (260)
On Convex Relaxations in Nonconvex Optimization
Chemical Engineering Transactions, 2011 Abstract preview not available - see full-text PDF article.
Tapio Westerlund +2 more
openaire +2 more sources
Adaptive Beamforming With Continuous/Discrete Phase Shifters via Convex Relaxation
IEEE Open Journal of Antennas and Propagation, 2022 Adaptive antenna array employing phase shifters only can reduce the hardware cost and power consumption, but the related optimization is well understood to be difficult to solve.
Yinman Lee
doaj +1 more source
On Convex Programming Relaxations for the Permanent
CoRR, 2017 In recent years, several convex programming relaxations have been proposed to estimate the permanent of a non-negative matrix, notably in the works of Gurvits and Samorodnitsky. However, the origins of these relaxations and their relationships to each other have remained somewhat mysterious.
Damian Straszak, Nisheeth K. Vishnoi
openaire +2 more sources
Lower Semicontinuous Convex Relaxation in Optimization
SIAM Journal on Optimization, 2013 We relate the argmin sets of a given function, not necessarily convex or lower semicontinuous, and its lower semicontinuous convex hull by means of explicit characterizations involving an appropriate concept of asymptotic functions. This question is connected to the subdifferential calculus of the Legendre--Fenchel conjugate function.
Rafael Correa, Abderrahim Hantoute
openaire +5 more sources
Secure beamforming design for IRS-assisted SWIPT Internet of things system
Tongxin xuebao, 2021 In order to meet the new requirements of intelligent signal processing deployment and physical layer security for green interconnection of things, a design method of secure beamforming was proposed to solve the problem of the shortage of sustainable ...
Zhengyu ZHU +4 more
doaj +2 more sources
Convex Relaxations of Convolutional Neural Nets [PDF]
ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019 We propose convex relaxations for convolutional neural nets with one hidden layer where the output weights are fixed. For convex activation functions such as rectified linear units, the relaxations are convex second order cone programs which can be solved very efficiently.
Burak Bartan, Mert Pilanci
openaire +2 more sources
A convex relaxation approach for power flow problem
Journal of Modern Power Systems and Clean Energy, 2019 A solution to the power flow problem is imperative for many power system applications and several iterative approaches are employed to achieve this objective.
Saeed D. Manshadi +4 more
doaj +1 more source
Sparse Non-negative Matrix Factorization Algorithm Based on Proximal Alternating Linearized Minimization [PDF]
Jisuanji gongcheng, 2019 This paper combinessparsity constraint and Proximal Alternating Linearized Minimization(PALM),proposes a Sparse Non-negative Matrix Factorization(SNMF) algorithm,called SNMF_PALM.The non-convex Smoothly Clipped Absolute Deviation(SCAD) function is used ...
WANG Jing,YANG Dan
doaj +1 more source
Convex-Optimization-Based Power-Flow Calculation Method for Offshore Wind Systems
Energies, 2022 Offshore wind farms have boomed worldwide due to the sustainability of wind power and ocean resources. Power grid companies should consider the wind power consumption problem with more power generated.
Yuwei Chen +5 more
doaj +1 more source
Random Laplacian Matrices and Convex Relaxations [PDF]
Foundations of Computational Mathematics, 2016 The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms, often the size of the largest diagonal entry.
openaire +2 more sources