Results 1 to 10 of about 294 (42)
A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive ...
Mirjam Dür, Franz Rendl
doaj +1 more source
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
On global optimization with indefinite quadratics
We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj +1 more source
A parametric linearizing approach for quadratically inequality constrained quadratic programs
In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj +1 more source
We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two‐sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient‐type methods for constrained optimization.
Stefan M. Stefanov
wiley +1 more source
In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc.
Tang Shuai, Chen Yuzhen, Guo Yunrui
doaj +1 more source
On the closure of the sum of closed subspaces
We give necessary and sufficient conditions for the sum of closed subspaces of a Hilbert space to be closed. Specifically, we show that the sum will be closed if and only if the angle between the subspaces is not zero, or if and only if the projection of either space into the orthogonal complement of the other is closed.
Irwin E. Schochetman +2 more
wiley +1 more source
On a class of multivalued variational inequalities
In this paper, we introduce and study a new class of variational inequalities, which are called multivalued variational inequalities. These variational inequalities include as special cases, the previously known classes of variational inequalities. Using projection techniques, we show that multivalued variational inequalities are equivalent to fixed ...
Muhammad Aslam Noor
wiley +1 more source
On certain classes of variational inequalities and related iterative algorithms
In this paper, we introduce and study some new classes of variational inequalities and Wiener‐Hopf equations. Essentially using the projection technique, we establish the equivalence between the multivalued general quasi‐variational inequalities and the multivalued implicit Wiener‐Hopf equations.
Muhammad Aslam Noor
wiley +1 more source
Abstract We compared referrals and connection to care between perinatal patients: 90 receiving OB/GYN care in clinics with integrated behavioral health consultants with infant mental health specialization (IMH‐BHC), and 68 receiving traditional care, in the United States.
Jennifer M. Jester +8 more
wiley +1 more source

