• 采用线性矩阵不等式方法,将问题转化为一个线性优化算法

    The problem is reduced to a linear convex optimization algorithm via LMI approach.

    youdao

  • 引入优化算法,求解使闭环系统渐稳定且性能指标上界最小控制器参数。

    The convex optimization algorithm was used to get the minima upper bound of performance cost and parameter of optimal minimax controller.

    youdao

  • 采用线性矩阵不等式技术问题转化线性优化算法,可问题全局

    Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.

    youdao

  • 根据优化理论,最性能标准控制器最优保性能可靠控制器的设计方法转化为一个线性凸优化算法

    On the basis of convex optimization theory, the design method about optimal guaranteed cost reliable controller and standard controller transform convex optimization arithmetic.

    youdao

  • 根据优化理论,最性能标准控制器最优保性能可靠控制器的设计方法转化一个线性凸优化算法

    On the basis of convex optimization theory, the design arithmetic method and its steps about optimal guaranteed cost reliable control are provided.

    youdao

  • 提出了求解一类带一般约束复合光滑优化信赖算法

    In this paper, we propose a new trust region algorithm for solving a class of composite nonsmooth optimization subject to convex constraints.

    youdao

  • 然后运用优化技术分析了该资源分配问题,基于拉格朗日对偶法给出了种子载波功率最优分配算法

    Then, by use of multiple carrier system's frequency-sharing property and convex optimization, a subcarrier and power optimal allocation algorithm is proposed based on Lagrangian duality theory.

    youdao

  • 它将机器学习问题转化为求解优化问题应用最优化理论构造算法解决二次规划问题。

    SVM transforms machine learning to solve an optimization problem, and to solve a convex quadratic programming problem by the optimization theory and method constructing algorithms.

    youdao

  • 参数优化算法对偶松弛规划算法的主循环之外,通过少量参数化扩展得到

    Based on dual relaxation method to extend a special convex separable programming algorithm, this tracking algorithm was constructed by parametric analysis.

    youdao

  • 混合优化控制算法给出了求解最优控制器上逼近算法及其二次规划求解方法。

    Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.

    youdao

  • 算法是在ML算法基础上放松约束条件,将问题转化多项式时间解决凸优化问题。

    These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.

    youdao

  • 针对电力系统中水火电短期优化调度,这一典型高维、非、非线性优化问题,本文提出改进的微分进化算法

    The model based on energy-saving emission reduction and environmental protection, will provided new ideas for optimal scheduling of short-term study of water and thermal power system.

    youdao

  • 算法基于优化理论,功率分配子载波配对中继选择用户选择进行了联合优化

    Based on the convex optimization, the algorithm jointly optimizes power allocation, subcarrier pairing, relay selection and user selection.

    youdao

  • 第六章,由第五章求解约束问题多维信赖修正算法出发,将其推广到界约束乃至约束的优化问题。

    Numerical results show that the present algorithm is efficient and reliable. The last chapter, we present a modified filter trust region method for bound constrained problems.

    youdao

  • 修正算法对于约束优化问题全局收敛,最后我们通过一组数值试验验证了新算法实际运行效果

    Global convergence is promoted through the use of the filter and the convergence theory holds for convex constrained problems. Numerical results demonstrate the efficiency of the modified algorithm.

    youdao

  • 修正算法对于约束优化问题全局收敛,最后我们通过一组数值试验验证了新算法实际运行效果

    Global convergence is promoted through the use of the filter and the convergence theory holds for convex constrained problems. Numerical results demonstrate the efficiency of the modified algorithm.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定