Results 41 to 50 of about 724 (154)
Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs [PDF]
, 2020 We study the problem of decomposing the Hessian matrix of a Mixed-Integer Convex Quadratic Program into the sum of positive semidefinite 2x2 matrices. Solving this problem enables the use of Perspective Reformulation techniques for obtaining strong lower
Claudio Gentile +2 more
core +1 more source
Negativity‐preserving transforms of tuples of symmetric matrices
Proceedings of the London Mathematical Society, Volume 132, Issue 4, April 2026.Abstract Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining recent advances in matrix analysis with some novel arguments relying on well‐chosen test matrices, Sidon ...
Alexander Belton +3 more
wiley +1 more source
Tractable convex relaxations of nonconvex quadratic optimization problems [PDF]
A quadratically constrained quadratic program (QCQP) is an optimization problem in which a (possibly nonconvex) quadratic function is minimized subject to a combination of linear and quadratic constraints.
Qiu, Yuzhou
core +1 more source
International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 2907-2926, 25 March 2026.ABSTRACT This study presents a novel Distributed Robust Adaptive Model Predictive Control (DRAMPC) for tracking in multi‐agent systems. The framework is designed to work with dynamically coupled subsystems and limited communication, which is restricted to local neighborhoods.
Fabio Faliero +2 more
wiley +1 more source
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract We count and give a parametrization of connected components in the space of flags transverse to a given transverse pair in every flag varieties of SO0(p,q)$\operatorname{SO}_0(p,q)$. We compute the effect the involution of the unipotent radical has on those components and, using methods of Dey–Greenberg–Riestenberg, we show that for certain ...
Clarence Kineider, Roméo Troubat
wiley +1 more source
Biometrical Journal, Volume 68, Issue 1, February 2026.ABSTRACT We evaluate the relevance of external quantitative information on the parameter of a Gaussian graphical model from high‐dimensional data. This information comes in the form of a parameter value available from a related knowledge domain or population.
Kai Ruan +2 more
wiley +1 more source
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation [PDF]
, 2019 We propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Reformulation). The resolution is based on a 3-phase method.
Lazare, Arnaud +2 more
core +1 more source
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization [PDF]
, 2019 International audienceOptimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality.
Godard, Hadrien +9 more
core +1 more source
On the quadratic fractional optimization with a strictly convex quadratic constraint [PDF]
, 2015 summary:In this paper, we have studied the problem of minimizing the ratio of two indefinite quadratic functions subject to a strictly convex quadratic constraint.
Salahi, Maziar, Fallahi, Saeed
core +1 more source
, 2014 In this paper, we propose a mixed-binary convex quadratic programming reformulation for the box-constrained nonconvex quadratic integer program and then implement IBM ILOG CPLEX 12.6 to solve the new model. Computational results demonstrate that our approach clearly outperform the very recent state-of-the-art solvers.
Xia, Yong, Han, Ying-Wei
openaire +2 more sources