Results 41 to 50 of about 330,664 (214)
Applied Sciences, 2016 Convex 1-D first-order total variation (TV) denoising is an effective method for eliminating signal noise, which can be defined as convex optimization consisting of a quadratic data fidelity term and a non-convex regularization term.
Cancan Yi, Yong Lv, Zhang Dang, Han Xiao
doaj +1 more source
Aerospace, 2023 This paper presents new techniques for the trajectory design and control of nonlinear dynamical systems. The technique uses a convex polytope to bound the range of the nonlinear function and associates with each vertex an auxiliary linear system ...
Olli Jansson, Matthew W. Harris
doaj +1 more source
On the Exactness of an Energy-efficient Train Control model based on Convex Optimization [PDF]
arXiv, 2022 In this paper, we demonstrate the exactness proof for the energy-efficient train control (EETC) model based on convex optimization. The proof of exactness shows that the convex optimization model will share the same optimization results with the initial model on which the convex relaxations are conducted. We first show how the relaxation on the initial
arxiv
Convex optimization–based multi-user detection in underwater acoustic sensor networks
International Journal of Distributed Sensor Networks, 2018 Multi-carrier code-division multiple access is an important technical means for high-performance underwater acoustic sensor networks. Nevertheless, severe multiple access interference is a huge challenge.
Jianping Wang +4 more
doaj +1 more source
Joint Transceiver Optimization for Multiuser Multi-Antenna Relay Systems With Energy Harvesting
IEEE 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
Distributed strongly convex optimization [PDF]
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012 18 pages single column draftcls format, 1 figure, Submitted to Allerton ...
Konstantinos I. Tsianos +1 more
openaire +3 more sources
A hypothesis about the rate of global convergence for optimal methods (Newtons type) in smooth convex optimization [PDF]
Компьютерные исследования и моделирование, 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
Greedy Approximation in Convex Optimization [PDF]
Constructive Approximation, 2015 We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using
Vladimir Temlyakov, Vladimir Temlyakov
openaire +3 more sources
Sensors, 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
Convex Discrete Optimization [PDF]
, 2008 We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial optimization problems and convex integer programming problems in variable dimension. We discuss some of the many applications
openaire +2 more sources