搜索结果: 1-15 共查到“管理科学与工程 programming”相关记录33条 . 查询时间(0.078 秒)
Optimal Excitation Signal Design for Frequency Domain System Identification Using Semidefinite Programming
Optimal Excitation Signal Design Frequency Domain System Identification Semidefinite Programming
2015/7/13
The paper discusses two methods of optimal excitation signal design for identification with Maximum Likelihood parameter estimation: The ‘classical’, dispersion function based method, and a new, semid...
Semidefinite Programming
semidefinite programming convex optimization interior-point methods eigenvalue optimization
2015/7/13
In semidefinite programming we minimize a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmo...
Semidefinite Programming Relaxations of Non-Convex Problems in Control and Combinatorial Optimization
Semidefinite Programming Relaxations Non-Convex Problems Control Combinatorial Optimization
2015/7/13
We point out some connections between applications of semidefinite programming in control and in combinatorial optimization. In both fields semidefinite programs arise as convex relaxations of NP-hard...
Control Applications of Nonlinear Convex Programming
linear programming convex optimization interior-point methods robust optimal control
2015/7/10
Since 1984 there has been a concentrated effort to develop efficient interior-point methods for linear programming (LP). In the last few years researchers have begun to appreciate a very important pro...
Connections Between Semi-Infinite and Semidefinite Programming
Connections Between Semi-Infinite Semidefinite Programming
2015/7/10
Some interesting semi-infinite optimization problems can be reduced to semidefinite optimization problems, and hence solved efficiently using recent interior-point methods. In this paper we discuss se...
In a second-order cone program (SOCP) a linear function is minimized over the intersection of an affine set and the product of second-order (quadratic) cones. SOCPs are nonlinear convex problems that ...
Optimization of Inductor Circuits via Geometric Programming
Optimization Inductor Circuits Geometric Programming
2015/7/10
We present an efficient method for optimal design and synthesis of CMOS inductors for use in RF circuits. This method uses the the physical dimensions of the inductor as the design parameters and hand...
A wide variety of nonlinear convex optimization problems can be cast as problems involving linear matrix inequalities (LMIs), and hence efficiently solved using recently developed interior-point metho...
Optimal Allocation of Local Feedback in Multistage Amplifiers via Geometric Programming
Amplifiers analog circuits circuit optimization design automation geometric programming sensitivity
2015/7/10
We consider the problem of optimally allocating local feedback to the stages of a multistage amplifier. The local feedback gains affect many performance indices for the overall amplifier, such as band...
Optimal Design of a CMOS Op-amp via Geometric Programming
Optimal Design CMOS Op-amp Geometric Programming
2015/7/10
We describe a new method for determining component values and transistor dimensions for CMOS operational amplifiers (op-amps). We observe that a wide variety of design objectives and constraints have ...
Advances in Convex Optimization:Interior-point Methods,Cone Programming, and Applications
Advances in Convex Optimization Interior-point Methods Cone Programming Applications
2015/7/10
In this talk I will give an overview of some major developments in convex optimization that have emerged over the last ten years or so. The basic idea is that convex problems are fundamentally tractab...
Geometric Programming Duals of Channel Capacity and Rate Distortion
Channel capacity convex optimization duality
2015/7/10
We show that the Lagrange dual problems of the channel capacity problem with input cost and the rate distortion problem are simple geometric programs. Upper bounds on channel capacity and lower bounds...
Designing Fast Distributed Iterations via Semidefinite Programming
Designing Fas Distributed Iterations Semidefinite Programming
2015/7/10
The general setting we consider involves a process, iteration, or method in which the computation or communication at each step is local, determined by a given graph, and involves some parameters or c...
Geometric Programming and its Applications to EDA Problems
Geometric Programming Applications EDA Problems
2015/7/10
Geometric programming (GP) describes a type of optimization problem that has been known since the 1970s, but recently has attracted more attention for several reasons. The first is the development of ...
Optimal Doping Profiles via Geometric Programming
Optimal Doping Profiles Geometric Programming
2015/7/10
We first consider the problem of determining the doping profile that minimizes base transit time in a (homojunction) bipolar junction transistor. We show that this problem can be formulated as a geome...