公开(公告)号：US20080072215A1

公开(公告)日：2008-03-20

申请号：US11986253

申请日：2007-11-19

申请人： Stephen Boyd ,  Xiling Shen ,  Mar Hershenson ,  Lieven Vandenberghe ,  Cesar Crusius ,  Dave Colleran ,  Sunderarjan Mohan

发明人： Stephen Boyd ,  Xiling Shen ,  Mar Hershenson ,  Lieven Vandenberghe ,  Cesar Crusius ,  Dave Colleran ,  Sunderarjan Mohan

IPC分类号： G06F9/44

CPC分类号： G06F17/11 ,  G06F8/427

摘要： A method and apparatus for parsing signomial and geometric programs, referred to herein as “the Parser”. Signomial and Geometric programming is a unique class of mathematical problems that is useful in the study of optimization problems. The Parser is a program designed to recognize and parse both signomial and geometric programs such that they may be accepted and solved by signomial and geometric program solvers. The Parser accepts an optimization problem from a user in the form of algebraic expressions. The Parser can then identify the problem as a signomial program and can further determine if it reduces to a geometric program. If either a signomial or geometric program exists, the Parser converts the algebraic expressions to a compact numeric format that can be accepted by a computer-aided solver. In the case of a geometric program, the solver may find a global solution to the optimization problem. However, in the case of signomial program, the solver may only find a local solution. The solution found by the solver is routed back to the Parser which reports it in a user-readable format.

摘要翻译： 用于解析符号和几何程序的方法和装置，这里称为“解析器”。 符号和几何编程是一类独特的数学问题，在优化问题的研究中是有用的。 解析器是一种旨在识别和解析符号和几何程序的程序，使得它们可以被符号和几何程序解算器接受和解决。 解析器以代数表达式的形式接受用户的优化问题。 然后，解析器可以将问题识别为签名程序，并且可以进一步确定它是否减少到几何程序。 如果存在符号或几何程序，则Parser将代数表达式转换为可由计算机辅助求解器接受的紧凑数字格式。 在几何程序的情况下，求解器可以找到优化问题的全局解。 然而，在签名程序的情况下，求解器只能找到本地解决方案。 解决方案找到的解决方案被路由回到以用户可读格式报告的解析器。

公开(公告)号：US07304544B2

公开(公告)日：2007-12-04

申请号：US10810444

申请日：2004-03-26

申请人： Dave Colleran ,  Arash Hassibi

发明人： Dave Colleran ,  Arash Hassibi

IPC分类号： G06F17/50 ,  H03L7/00

CPC分类号： G06F17/5063 ,  H03L7/08 ,  H03L7/0896 ,  H03L7/0995

摘要： A method is described that involves developing a more detailed description of a phase lock loop system by substituting, into a monomial or posynomial equation that is part of a family of monomial and posynomial expressions that describe functional characteristics of the PLL at the system level, a lower level expression that describes a characteristic of one the PLL's basic building blocks.

摘要翻译： 描述了一种方法，其涉及通过将作为描述在系统级的PLL的功能特性的单项和公式表达式的族的一部分的单项式或公式方程式代入相位锁环系统的更详细的描述， 低级表达式描述PLL的基本构建块的特性。

公开(公告)号：US07299459B1

公开(公告)日：2007-11-20

申请号：US09752541

申请日：2000-12-29

申请人： Stephen Boyd ,  Xiling Shen ,  Mar Hershenson ,  Lieven Vandenberghe ,  Cesar Crusius ,  Dave Colleran ,  Sunderarjan Mohan

发明人： Stephen Boyd ,  Xiling Shen ,  Mar Hershenson ,  Lieven Vandenberghe ,  Cesar Crusius ,  Dave Colleran ,  Sunderarjan Mohan

IPC分类号： G06F9/45 ,  G06F7/60

CPC分类号： G06F17/11 ,  G06F8/427

摘要： A method and apparatus for parsing signomial and geometric programs, referred to herein as “the Parser”. Signomial and Geometric programming is a unique class of mathematical problems that is useful in the study of optimization problems. The Parser is a program designed to recognize and parse both signomial and geometric programs such that they may be accepted and solved by signomial and geometric program solvers. The Parser accepts an optimization problem from a user in the form of algebraic expressions. The Parser can then identify the problem as a signomial program and can further determine if it reduces to a geometric program. If either a signomial or geometric program exists, the Parser converts the algebraic expressions to a compact numeric format that can be accepted by a computer-aided solver. In the case of a geometric program, the solver may find a global solution to the optimization problem. However, in the case of signomial program, the solver may only find a local solution. The solution found by the solver is routed back to the Parser which reports it in a user-readable format.

摘要翻译： 用于解析符号和几何程序的方法和装置，这里称为“解析器”。 符号和几何编程是一类独特的数学问题，在优化问题的研究中是有用的。 解析器是一种旨在识别和解析符号和几何程序的程序，使得它们可以被符号和几何程序解算器接受和解决。 解析器以代数表达式的形式接受用户的优化问题。 然后，解析器可以将问题识别为签名程序，并且可以进一步确定它是否减少到几何程序。 如果存在符号或几何程序，则Parser将代数表达式转换为可由计算机辅助求解器接受的紧凑数字格式。 在几何程序的情况下，求解器可以找到优化问题的全局解。 然而，在签名程序的情况下，求解器只能找到本地解决方案。 解决方案找到的解决方案被路由回到以用户可读格式报告的解析器。