quadratic programming
[数] 二次规划
2025-10-09 15:07 浏览次数 9
[数] 二次规划
quadratic bilevel programming二次双级规划
bilevel quadratic multiobjective programming双层二次多目标规划
quadratic network programming二次网络规化
quadratic c programming二次规划
quadratic parametric programming二次参数规划
quadratic constraints programming二次约束规划
quadratic integral programming二次整数规划
sequential quadratic programming (sqp) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
由于序列二次规划(sqp)算法具有快速收敛速度,所以它是求解光滑约束优化问题的有效方法之一。
a parametric quadratic programming approach developed for solving the elastic contact problems with friction and initial gaps is presented.
本文用参数二次规划法来解有间隙带摩擦弹性接触问题。
in this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
本文给出了无界域上大规模凹二次规划的一种下逼近算法,并证明了算法的收敛性。
a new iterative algorithm for quadratic programming is obtained when applying the general algorithm to quadratic programming.
把这种算法应用于二次规划,得到了二次规划的一种新的迭代法。
in this paper, we are concerned with the sequence quadratic programming (sqp) methods for solving constrained optimization problems.
本文研究求解约束最优化问题的序列二次规划算法(sqp算法)。
this paper describes the application of successive quadratic programming method(sqp) to design laser beam configuration in target area.
运用序列二次规划法设计了靶区光路。
by using direct shooting method, the associated optimization was converted into a nonlinear programming problem, which was solved through a sequential quadratic programming solver.
利用直接打靶法,将此最优控制模型转化为非线性规划问题,并采用序列二次规划算法进行解算。
lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
混合优化控制算法,给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
to realize weighting in motion, a method for dynamic locally weighting based on sequential quadratic programming was put forward.
为实现动态称重,提出了基于序列二次规划的动态可局部称重方法。
the sequential quadratic programming algorithm of optimization toolbox of matlab is effectively used to solve the model after it is concisely introd.
在简要介绍matlab优化工具箱中的序列二次规划法后,采用该算法求出设计结果。
in this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题,给出了一个分枝定界方法。
a region decomposition method to solve a positive definite quadratic programming is presented.
给出了一个求解正定二次规划的区域分解方法。
a new algorithm for dynamic elastoplastic analysis is put forward on the basis of parametric quadratic programming and exact integration.
给出了将参数二次规划方法与精细积分方法相结合进行结构弹塑性动力响应分析的一条新途径。
based on the elementary idea of kernel mapping and the principle of structural risk minimization, svr transforms the regression problem into a quadratic programming problem.
支持向量回归采用核映射的基本思想,基于结构风险最小化原则,将回归问题转化为一个二次规划问题。
the quadratic programming method is used to solve the short-term power generation scheduling problem under the condition of electricity market and considering the ramp constraints of generating sets.
文中以二次规划算法解决了电力市场环境下考虑爬坡约束的短期发电计划的制定问题。
this method splits the primal problem into two parts, a master problem which is a quadratic programming and several sub-problems which are linear programmings.
该方法的高级问题是一个二次规划问题,而低级子问题是若干个小规模的线性规划问题。
this paper proposes a decomposition algorithm for large scale quadratic programming with a pseudoconvex objective function.
对于大规模的具有伪凸目标函数的二次规划问题,本文提出一种分解算法。
this paper considers the extended quadratic programming problem. based on the necessary and sufficient conditions for a saddle point, a neural network for solving it is proposed.
考虑了广义二次规划问题,基于其鞍点的充要条件,提出了求解它的一个神经网络。
in this paper we present a new algorithm for solving quadratic programming problem (qp) with quadratic constraints.
在本文中,我们提出了一种解带有二次约束二次规划问题(qp)的新算法。
this method includes fixed cost in generation and transmission cost optimization function and a quadratic programming model is proposed.
该方法在目标函数中考虑了电网的固定成本,形成了以系统发、输电费用最小为优化条件的二次规划模型。
a new gradient-based neural network for solving convex quadratic programming problems is proposed by means of the inherent properties of the original problem.
根据问题自身的结构特点,通过将其转化为等价的方程,提出了求解凸二次规划的一个基于梯度的新神经网络模型。