Results 31 to 40 of about 29,427 (150)

Convex Formulations for Antenna Array Pattern Optimization Through Linear, Quadratic, and Second-Order Cone Programming

open access: yesMathematics
This work presents a comprehensive study on formulations for the radiation pattern design of antenna arrays through convex optimization techniques, with a focus on linear, quadratic, and second-order cone programming. The proposed approaches heavily rely
Álvaro F. Vaquero, Juan Córcoles
doaj   +1 more source

Optimal Energy-Delay in Energy Harvesting Wireless Sensor Networks with Interference Channels

open access: yesSensors, 2019
In this work, we investigate the capacity allocation problem in the energy harvesting wireless sensor networks (WSNs) with interference channels. For the fixed topologies of data and energy, we formulate the optimization problem when the data flow ...
Dongbin Jiao   +3 more
doaj   +1 more source

First-Order Methods for Convex Optimization

open access: yesEURO Journal on Computational Optimization, 2021
First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky   +2 more
doaj   +1 more source

Joint Transceiver Optimization for Multiuser Multi-Antenna Relay Systems With Energy Harvesting

open access: yesIEEE Access, 2019
In this paper, a multiuser multi-antenna relay system with wireless power transfer is investigated, where the relay node harvests energy from the radio frequency signal sent from the source node and utilizes the harvested energy to forward the ...
Jinlong Wang   +4 more
doaj   +1 more source

Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method

open access: yesInternational Journal of Aerospace Engineering, 2019
A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal ...
Chun-Mei Yu, Dang-Jun Zhao, Ye Yang
doaj   +1 more source

A Sparse Representation-Based Deployment Method for Optimizing the Observation Quality of Camera Networks

open access: yesSensors, 2013
Deployment is a critical issue affecting the quality of service of camera networks. The deployment aims at adopting the least number of cameras to cover the whole scene, which may have obstacles to occlude the line of sight, with expected observation ...
Guangming Shi   +3 more
doaj   +1 more source

Research on Energy Efficiency of Wireless Powered Communication Network in Cognitive Radio Environment [PDF]

open access: yesJisuanji gongcheng, 2019
In order to improve the energy efficiency of Wireless Powered Communication Network(WPCN),a multiple signal source acquisition model in cognitive radio environment is established.Because the model optimization problem is a non-convex problem,it is ...
FENG Gang,QIN Xizhong,JIA Zhenhong,NIU Hongmei,WANG Zhehui
doaj   +1 more source

Immune-Commensal-Evolutionary Programming for solving non-smooth/non-convex economic dispatch problem

open access: yesEnergy Reports, 2020
This paper presents the development of a new hybrid optimization technique termed as Immune-Commensal-Evolutionary Programming (ICEP) and its implementation to solve non-smooth/ non-convex Economic Dispatch (ED) problem.
Mohd Helmi Mansor   +5 more
doaj   +1 more source

A hypothesis about the rate of global convergence for optimal methods (Newtons type) in smooth convex optimization [PDF]

open access: yesКомпьютерные исследования и моделирование, 2018
In this paper we discuss lower bounds for convergence of convex optimization methods of high order and attainability of this bounds. We formulate a hypothesis that covers all the cases.
Alexander Vladimirovich Gasnikov   +1 more
doaj   +1 more source

Convex optimization using quantum oracles [PDF]

open access: yesQuantum, 2020
We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different ...
Joran van Apeldoorn   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy