专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20130325148A1 EFFICIENT QUADRATIC PROGRAMMING (QP) SOLVER FOR PROCESS CONTROL AND OPTIMIZATION 有权
标题翻译：有效的四元编程（QP）过程控制和优化解决方案
公开(公告)号：US20130325148A1
公开(公告)日：2013-12-05
申请号：US13485594
申请日：2012-05-31
申请人： Ghulam Mustafa , Jiadong Wang , Tongwen Chen , Danlei Chu , Johan U. Backstrom
发明人： Ghulam Mustafa , Jiadong Wang , Tongwen Chen , Danlei Chu , Johan U. Backstrom
IPC分类号： G05B13/02
CPC分类号： G05B13/048
摘要： A method includes identifying an initial solution to a quadratic programming (QP) problem associated with a process. The method also includes performing an iterative procedure having one or more iterations. Each iteration includes determining whether any constraint associated with the process is violated in the solution. Each iteration also includes selecting a violated constraint, determining a step direction and a step length associated with the selected violated constraint, and updating the solution based on the step direction and the step length. Determining the step direction and the step length includes using a Schur complement based on an active set of constraints associated with the solution. The Schur complement is nonsingular during all iterations of the iterative procedure except when the active set is empty.
摘要翻译：一种方法包括识别与过程相关联的二次规划（QP）问题的初始解决方案。该方法还包括执行具有一个或多个迭代的迭代过程。每个迭代包括确定解决方案中是否违反与进程相关联的约束。每个迭代还包括选择违反的约束，确定与所选择的违反约束相关联的步长方向和步长，以及基于步长方向和步长来更新解。确定步骤方向和步长包括使用基于与该解决方案相关联的一组有效约束的Schur补码。在迭代过程的所有迭代期间，Schur补码是非奇异的，除非活动集为空。

2. 发明授权

US08600525B1 Efficient quadratic programming (QP) solver for process control and optimization 有权
标题翻译：用于过程控制和优化的高效二次规划（QP）求解器
公开(公告)号：US08600525B1
公开(公告)日：2013-12-03
申请号：US13485594
申请日：2012-05-31
申请人： Ghulam Mustafa , Jiadong Wang , Tongwen Chen , Danlei Chu , Johan U. Backstrom
发明人： Ghulam Mustafa , Jiadong Wang , Tongwen Chen , Danlei Chu , Johan U. Backstrom
IPC分类号： G05B15/00 , G05B13/02
CPC分类号： G05B13/048
摘要： A method includes identifying an initial solution to a quadratic programming (QP) problem associated with a process. The method also includes performing an iterative procedure having one or more iterations. Each iteration includes determining whether any constraint associated with the process is violated in the solution. Each iteration also includes selecting a violated constraint, determining a step direction and a step length associated with the selected violated constraint, and updating the solution based on the step direction and the step length. Determining the step direction and the step length includes using a Schur complement based on an active set of constraints associated with the solution. The Schur complement is nonsingular during all iterations of the iterative procedure except when the active set is empty.
摘要翻译：一种方法包括识别与过程相关联的二次规划（QP）问题的初始解决方案。该方法还包括执行具有一个或多个迭代的迭代过程。每个迭代包括确定解决方案中是否违反与进程相关联的约束。每个迭代还包括选择违反的约束，确定与所选择的违反约束相关联的步长方向和步长，以及基于步长方向和步长来更新解。确定步骤方向和步长包括使用基于与该解决方案相关联的一组有效约束的Schur补码。在迭代过程的所有迭代期间，Schur补码是非奇异的，除非活动集为空。

3. 外观设计

USD994335S1 Storage box 有权
公开(公告)号：USD994335S1
公开(公告)日：2023-08-08
申请号：US29838514
申请日：2022-05-13
申请人： Jiadong Wang
设计人： Jiadong Wang
摘要： FIG. 1 is a first perspective view of a storage box showing my new design;
FIG. 2 is a second perspective view thereof;
FIG. 3 is a front view thereof;
FIG. 4 is a back view thereof;
FIG. 5 is a left side view thereof;
FIG. 6 is a right side view thereof;
FIG. 7 is a top view thereof;
FIG. 8 is a bottom view thereof; and,
FIG. 9 is an enlarged view of the selected portion 9 in FIG. 1.
The broken lines shown in the drawings depict portions of the storage box that form no part of the claimed design. The dot-dash broken lines encircling portions of the storage box shown within the area designated as 9 in FIG. 1 and illustrated in enlarged view in FIG. 9 form no part of the claimed design.

4. 外观设计

USD971650S1 Locker 有权
公开(公告)号：USD971650S1
公开(公告)日：2022-12-06
申请号：US29838515
申请日：2022-05-13
申请人： Jiadong Wang
设计人： Jiadong Wang

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式