A practical and efficient approach to the constrained via minimization problem [PDF]
, 2001 This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a feasible partial routing.
Hock-Chuan Chua +5 more
core +1 more source
Journal of Function Spaces and Applications, 2012 It is well known that the gradient-projection algorithm (GPA) for solving constrained convex minimization problems has been proven to have only weak convergence unless the underlying Hilbert space is finite dimensional.
Lu-Chuan Ceng, Ching-Feng Wen
doaj +1 more source
A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems [PDF]
SIAM Journal on Scientific Computing, 1999 . A subspace adaptation of the Coleman-Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems.
Mary Ann Branch, T. Coleman, Yuying Li
semanticscholar +2 more sources
A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
Journal of Applied Mathematics, 2012 It is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient ...
Ming Tian, Min-Min Li
doaj +1 more source
Non-Convex Split Feasibility Problems: Models, Algorithms and Theory
Open Journal of Mathematical Optimization, 2020 In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantages in different settings of the ...
Gibali, Aviv +2 more
doaj +1 more source
Distributed Constrained Optimization and Consensus in Uncertain Networks via Proximal Minimization [PDF]
IEEE Transactions on Automatic Control, 2016 We provide a unifying framework for distributed convex optimization over time-varying networks, in the presence of constraints and uncertainty, features that are typically treated separately in the literature. We adopt a proximal minimization perspective
Kostas Margellos +3 more
semanticscholar +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 ...
Irving, MR +4 more
core +1 more source
A Constrained ℓ1 Minimization Approach to Sparse Precision Matrix Estimation [PDF]
, 2011 This article proposes a constrained ℓ1 minimization method for estimating a sparse inverse covariance matrix based on a sample of n iid p-variate random variables. The resulting estimator is shown to have a number of desirable properties.
T. Cai, Weidong Liu, Xi Luo
semanticscholar +1 more source
A comparison of classical scheduling approaches in power-constrained block-test scheduling [PDF]
, 2000 Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned ...
Wang, Xiaojun +6 more
core +1 more source
Soft Error-Aware Design Optimization of Low Power and Time-Constrained Embedded Systems [PDF]
, 2010 In this paper, we present the first study that examines the impact of application task mapping on the reliability of multiprocessor system-on-chip (MPSoC) in the presence of single-event upsets (SEUs).
Rishad A Shafik +5 more
core +1 more source