36 research outputs found
A guaranteed-convergence framework for passivity enforcement of linear macromodels
Passivity enforcement is a key step in the extraction of linear macromodels of electrical interconnects and packages for Signal and Power Integrity applications. Most state-of-the-art techniques for passivity enforcement are based on suboptimal or approximate formulations that do not guarantee convergence. We introduce in this paper a new rigorous framework that casts passivity enforcement as a convex non-smooth optimization problem. Thanks to convexity, we are able to prove convergence to the optimal solution within a finite number of steps. The effectiveness of this approach is demonstrated through various numerical example
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution at a rate determined by the second smallest eigenvalue lambda_2 of the Laplacian of the weighted graph. In this paper we consider the problem of assigning transition rates to the edges so as to maximize lambda_2 subject to a linear constraint on the rates. This is the problem of finding the fastest mixing Markov process (FMMP) on the graph. We show that the FMMP problem is a convex optimization problem, which can in turn be expressed as a semidefinite program, and therefore effectively solved numerically. We formulate a dual of the FMMP problem and show that it has a natural geometric interpretation as a maximum variance unfolding (MVU) problem, , the problem of choosing a set of points to be as far apart as possible, measured by their variance, while respecting local distance constraints. This MVU problem is closely related to a problem recently proposed by Weinberger and Saul as a method for "unfolding" high-dimensional data that lies on a low-dimensional manifold. The duality between the FMMP and MVU problems sheds light on both problems, and allows us to characterize and, in some cases, find optimal solutions
Subgradient Techniques for Passivity Enforcement of Linear Device and Interconnect Macromodels
This paper presents a class of nonsmooth convex optimization methods for the passivity enforcement of reduced-order macromodels of electrical interconnects, packages, and linear passive devices. Model passivity can be lost during model extraction or identification from numerical field solutions or direct measurements. Nonpassive models may cause instabilities in transient system-level simulation, therefore a suitable postprocessing is necessary in order to eliminate any passivity violations. Different from leading numerical schemes on the subject, passivity enforcement is formulated here as a direct frequency-domain norm minimization through perturbation of the model state-space parameters. Since the dependence of this norm on the parameters is nonsmooth, but continuous and convex, we resort to the use of subdifferentials and subgradients, which are used to devise two different algorithms. We provide a theoretical proof of the global optimality for the solution computed via both schemes. Numerical results confirm that these algorithms achieve the global optimum in a finite number of iterations within a prescribed accuracy leve
A sequential semidefinite programming method and an application in passive reduced-order modeling
We consider the solution of nonlinear programs with nonlinear
semidefiniteness constraints. The need for an efficient exploitation of the
cone of positive semidefinite matrices makes the solution of such nonlinear
semidefinite programs more complicated than the solution of standard nonlinear
programs. In particular, a suitable symmetrization procedure needs to be chosen
for the linearization of the complementarity condition. The choice of the
symmetrization procedure can be shifted in a very natural way to certain linear
semidefinite subproblems, and can thus be reduced to a well-studied problem.
The resulting sequential semidefinite programming (SSP) method is a
generalization of the well-known SQP method for standard nonlinear programs. We
present a sensitivity result for nonlinear semidefinite programs, and then
based on this result, we give a self-contained proof of local quadratic
convergence of the SSP method. We also describe a class of nonlinear
semidefinite programs that arise in passive reduced-order modeling, and we
report results of some numerical experiments with the SSP method applied to
problems in that class
Computation of Khun-Tucker triples in optimum design problems in the presence of parametric singularities
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/76242/1/AIAA-1994-4416-414.pd
Convex Passivity Enforcement of Linear Macromodels via Alternate Subgradient Iterations
This paper introduces a new algorithm for passivity enforcement of linear lumped macromodels in scattering form. As typical in most state of the art passivity enforcement methods, we start with an initial non-passive macromodel obtained by a Vector Fitting process, and we perturb its parameters to make it passive. The proposed scheme is based on a convex formulation of both passivity constraints and objective function for accuracy preservation, thus allowing a formal proof of convergence to the unique optimal passive macromodel. This is a distinctive feature that differentiates the new scheme with respect to most state of the art methods, which either do not guarantee convergence or are not able to provide the most accurate solution. The presented algorithm can thus be safely used for those cases for which existing techniques fail. We illustrate the advantages of proposed method on a few benchmarks