Results 1 to 10 of about 325 (51)
, 2021 Robust Optimization (RO) arises in two stages of optimization, first level for maximizing over the uncertain data and second level for minimizing over the feasible set.
M. Barro +3 more
semanticscholar +1 more source
CSIAM Transaction on Applied Mathematics, 2020 An implicit evaluation method of vector 2-norms is presented for function evaluations arising from sphere constrained quadratic optimizations. The efficiency of the method in terms of computational costs mainly comes from the well-known shifted conjugate
T. Suzuki
semanticscholar +1 more source
Characterization of the Oblique Projector $U(VU)^+V$ with Application to Constrained Least Squares [PDF]
, 2009 We provide a full characterization of the oblique projector $U(VU)^+V$ in the general case where the range of $U$ and the null space of $V$ are not complementary subspaces.
Aleš Černý +12 more
core +2 more sources
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 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
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations [PDF]
, 2015 We propose two exact approaches for non-convex quadratic integer minimization subject to linear constraints where lower bounds are computed by considering ellipsoidal relaxations of the feasible set.
Buchheim, Christoph +2 more
core +1 more source
EURO Journal on Computational Optimization, 2021 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
A parametric linearizing approach for quadratically inequality constrained quadratic programs
Open Mathematics, 2018 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
Journal of Applied Mathematics, Volume 2004, Issue 5, Page 409-431, 2004., 2004 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
Open Mathematics, 2018 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
CONTROLLING THE FORCING OF THE LINEAR TRANSPORT EQUATION TO MEET AIR QUALITY NORMS AT EVERY POINT
, 2017 A three-dimensional dispersion air pollution model for point, line or area sources is considered in a limited region. Particular solutions of such model and their respective maximum values are used to pose a quadratic programming problem with the aim to ...
D. Parra-Guevara +2 more
semanticscholar +1 more source