Results 31 to 40 of about 229,971 (268)
Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method
Advances in Multimedia, 2014 Image deblurring is formulated as an unconstrained minimization problem, and its penalty function is the sum of the error term and TVp-regularizers with ...
Su Xiao
doaj +1 more source
Proposed shunt rounding technique for large-scale security constrained loss minimization [PDF]
, 2010 The official published version can be obtained from the link below - Copyright @ 2010 IEEE.Optimal reactive power flow applications often model large numbers of discrete shunt devices as continuous variables, which are rounded to their nearest discrete ...
Hurlock, P +4 more
core +1 more source
The Timetable Constrained Distance Minimization Problem [PDF]
Annals of Operations Research, 2006 We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. The problem consists of finding an optimal home-away assignment when the opponents of each team in each time slot are given.
Rasmussen, Rasmus Vinther +1 more
openaire +3 more sources
Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 We review the superiorization methodology, which can be thought of, in some cases, as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full edged constrained minimization problem; rather, the task is to ...
Censor Yair
doaj +1 more source
Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices [PDF]
, 2013 This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery.
Cai, T. Tony, Zhang, Anru
core +3 more sources
Constrained Next-to-Minimal Supersymmetric Standard Model [PDF]
Physical Review Letters, 2008 We consider the fully constrained version of the next-to-minimal supersymmetric extension of the standard model (cNMSSM) in which a singlet Higgs superfield is added to the two doublets that are present in the minimal extension (MSSM). Assuming universal boundary conditions at a high scale for the soft supersymmetry-breaking gaugino, sfermion and Higgs
Djouadi, A. +2 more
openaire +3 more sources
Bounded perturbation resilience of the viscosity algorithm
Journal of Inequalities and Applications, 2016 In this article, we investigate the bounded perturbation resilience of the viscosity algorithm and propose the superiorized version of the viscosity algorithm. The convergence of the proposed algorithm is analyzed for a nonexpansive mapping.
Qiao-Li Dong, Jing Zhao, Songnian He
doaj +1 more source
Constrained Minimization Algorithms. Linear Models [PDF]
, 2020 This book is a collection of 19 articles which reflect the courses given at the Collège de France/Summer school “Reconstruction d'images − Applications astrophysiques“ held in Nice and Fréjus, France, from June 18 to 22, 2012. The articles presented in this volume address emerging concepts and methods that are useful in the complex process of improving
Lantéri, H., Theys, C., Richard, C.
openaire +2 more sources
, 2012 This paper considers linear minimum meansquare- error (MMSE) transceiver design problems for downlink multiuser multiple-input multiple-output (MIMO) systems where imperfect channel state information is available at the base station (BS) and mobile ...
Bogale, Tadilo Endeshaw +1 more
core +1 more source
A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem [PDF]
, 2015 The problem of finding network codes for general connections is inherently difficult in capacity constrained networks. Resource minimization for general connections with network coding is further complicated.
Cui, Ying +6 more
core +2 more sources