Browsing by Keywords "Convex optimization"
Now showing items 1-18 of 18
-
Competitive linear MMSE estimation under structured data uncertainties
(IEEE Computer Society, 2014)In this paper, we consider the linear estimation problem under structured data uncertainties. A robust algorithm is presented under bounded uncertainties under the mean square error (MSE) criterion. The performance of the ... -
Denoising images corrupted by impulsive noise using projections onto the epigraph set of the total variation function (PES-TV)
(Springer U K, 2015)In this article, a novel algorithm for denoising images corrupted by impulsive noise is presented. Impulsive noise generates pixels whose gray level values are not consistent with the neighboring pixels. The proposed ... -
FIR filter design by convex optimization using directed iterative rank refinement algorithm
(Institute of Electrical and Electronics Engineers Inc., 2016)The advances in convex optimization techniques have offered new formulations of design with improved control over the performance of FIR filters. By using lifting techniques, the design of a length-L FIR filter can be ... -
FIR filter design by iterative convex relaxations with rank refinement
(IEEE, 2014)Finite impulse response (FIR) filters have been a primary topic of digital signal processing since their inception. Although FIR filter design is an old problem, with the developments of fast convex solvers, convex modelling ... -
A heterogeneous memory organization with minimum energy consumption in 3D chip-multiprocessors
(IEEE, 2016-05)Main memories play an important role in overall energy consumption of embedded systems. Using conventional memory technologies in future designs in nanoscale era cause a drastic increase in leakage power consumption and ... -
High performance 3D CMP design with stacked hybrid memory architecture in the dark silicon era using a convex optimization model
(IEEE, 2016-05)In this article, we present a convex optimization model to design a stacked hybrid memory system to improve performance and reduce energy consumption of the chip-multiprocessor (CMP). Our convex model optimizes numbers and ... -
A high-performance hybrid memory architecture for embedded CMPs using a convex optimization model
(IEEE, 2015-11)In this article, we present a convex optimization model to design a stacked hybrid memory system for 3D embedded chip-multiprocessors (eCMP). Our convex model optimizes numbers and placement of SRAM and STT-RAM memories ... -
Hybrid stacked memory architecture for energy efficient embedded chip-multiprocessors based on compiler directed approach
(IEEE, 2015-12)Energy consumption becomes the most critical limitation on the performance of nowadays embedded system designs. On-chip memories due to major contribution in overall system energy consumption are always significant issue ... -
Image restoration and reconstruction using projections onto epigraph set of convex cost fuchtions
(Bilkent University, 2015)This thesis focuses on image restoration and reconstruction problems. These inverse problems are solved using a convex optimization algorithm based on orthogonal Projections onto the Epigraph Set of a Convex Cost functions ... -
Non-linear pricing by convex duality
(Elsevier, 2015)We consider the pricing problem of a risk-neutral monopolist who produces (at a cost) and offers an infinitely divisible good to a single potential buyer that can be of a finite number of (single dimensional) types. The ... -
On explicit solutions of a two-echelon supply chain coordination game
(Springer Verlag, 2018)A contracting game under asymmetric information specific to two-echelon supply chain coordination between a retailer of unknown type and a supplier is studied. When the parameter which is private information to the retailer ... -
OptMem: dark-silicon aware low latency hybrid memory design
(IEEE, 2016-01)In this article, we present a convex optimization model to design a three dimension (3D)stacked hybrid memory system to improve performance in the dark silicon era. Our convex model optimizes numbers and placement of static ... -
Projections onto convex sets (POCS) based optimization by lifting
(IEEE, 2013)A new optimization technique based on the projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by ... -
Self-Scaled Barrier Functions on Symmetric Cones and Their Classification
(2002)Self-scaled barrier functions on self-scaled cones were axiomatically introduced by Nesterov and Todd in 1994 as a tool for the construction of primal-dual long-step interior point algorithms. This paper provides firm ... -
Stochastic subgradient algorithms for strongly convex optimization over distributed networks
(IEEE Computer Society, 2017)We study diffusion and consensus based optimization of a sum of unknown convex objective functions over distributed networks. The only access to these functions is through stochastic gradient oracles, each of which is only ... -
A subgradient descent algorithm for optimization of initially controllable flow shop systems
(2009)We consider an optimization problem for deterministic flow shop systems processing identical jobs. The service times are initially controllable; they can only be set before processing the first job, and cannot be altered ... -
TW-TOA based positioning in the presence of clock imperfections
(Elsevier Inc., 2016)This manuscript studies the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in semi-asynchronous wireless sensor networks in which the clock of a target node is unsynchronized with the reference ... -
Ultra-wideband orthogonal pulse shape set design by using Hermite-Gaussian functions
(IEEE, 2012)Ultra-Wideband (UWB) communication systems have been developed for short distance, high data rate communications. To avoid interfering with the existing systems in the same environment, very short duration pulses used by ...
