نتایج جستجو برای: quadratic optimization
تعداد نتایج: 358632 فیلتر نتایج به سال:
this study focuses on the optimization of the plane structure. sequential quadratic programming (sqp) will be utilized, which is one of the most efficient methods for solving nonlinearly constrained optimization problems. a new formulation for the second order sensitivity analysis of the two-dimensional finite element will be developed. all the second order required derivatives will be calculat...
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
We propose a class of quadratic optimization problems whose exact optimal objective values can be computed by their completely positive cone programming relaxations. The objective function can be any quadratic form. The constraints of each problem are described in terms of quadratic forms with no linear terms, and all constraints are homogeneous equalities, except one inhomogeneous equality whe...
We propose a class of quadratic optimization problems whose exact optimal objective values can be computed by their completely positive cone programming relaxations. The objective function can be any quadratic form. The constraints of each problem are described in terms of quadratic forms with no linear terms, and all constraints are homogeneous equalities, except one inhomogeneous equality whe...
The Quadratic Convex Reformulation (QCR) method is used to solve quadratic unconstrained binary optimization problems. In this method, the semidefinite relaxation is used to reformulate it to a convex binary quadratic program which is solved using mixed integer quadratic programming solvers. We extend this method to random quadratic unconstrained binary optimization problems. We develop a Penal...
In this paper, we consider minimizing the ratio of two indefinite quadratic functions subject to two quadratic constraints. Using the extension of Charnes– Cooper transformation, we transform the problem to a homogenized quadratic problem. Then, we show that, under certain assumptions, it can be solved to global optimality using semidefinite optimization relaxation.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید