On the solution existence of nonconvex quadratic programming problems in Hilbert spaces (Q1696189): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1604.04841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Frank--Wolfe type theorem for convex polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set intersection theorems and existence of optimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for quadratic minimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution existence of convex quadratic programming problems in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the theory of quadratic forms in Hilbert space to the calculus of variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution existence and stability of quadratically constrained convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extensions of the Frank-Wolfe theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite positive-definite quadratic programming in a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex optimization problem: The infinite-horizon linear-quadratic control problem with quadratic constraints / rank
 
Normal rank

Latest revision as of 04:00, 15 July 2024

scientific article
Language Label Description Also known as
English
On the solution existence of nonconvex quadratic programming problems in Hilbert spaces
scientific article

    Statements

    On the solution existence of nonconvex quadratic programming problems in Hilbert spaces (English)
    0 references
    0 references
    0 references
    14 February 2018
    0 references
    The aim of this paper is to provide existence results for the following problem (QP): \[ \begin{cases} \min f(x):=\frac{1}{2}\langle x,Tx\rangle +\langle c,x\rangle\\ \mathrm{s.t.}\;x\in {F}, {\mathrm{where}}\; F:=\{x\in {\mathcal{H}}:\; g_i(x):=\frac{1}{2}\langle x,T_i x\rangle +\langle c_i,x\rangle+\alpha_i\leq 0,\; i=1,,2,\dots, m\}, \end{cases} \] where \(\mathcal{H}\) is a Hilbert space, \(T:\mathcal{H}\to \mathcal{H}\) is a continuous self-adjoint operator, \(T_i\) is a positive semidefinite continuous linear self-adjoint operator on \(\mathcal{H},\) \(c,c_i\in \mathcal{H},\) and \(\alpha, \alpha_i\) are real numbers, \(i=1,2,\dots, m.\) Despite the feasible set is always convex, the problem (QP) is not, in general, a convex problem. The main results of the paper are the content of Theorem 2 and Theorem 5; both provide a sufficient condition for the existence of an optimal solution on a nonempty set \(F\). The assumptions of Theorem 2 are the following: \(f\) is bounded from below over \(F,\) \((v\in 0^+F,\langle v,Tv\rangle=0)\Rightarrow \langle c_i,v\rangle =0,\forall i: T_i\neq 0,\) and \(\langle x,Tx\rangle\) is a Legendre form (i.e., \(Q\) is weakly lower semicontinuous, and, if \(x_k\) weakly converges to \(x_0\) and \(Q(x_k)\) converges to \(Q(x_0)\), then \(x_k\) strongly converges to \(x_0\)). Here, \(0^+F\) denotes the recession cone of \(F.\) The second assumption can be dropped in case \(m=1.\) In Theorem 5, the assumption that \(\langle x,Tx\rangle\) is a Legendre form is replaced by the request that \(T, T_i\) (\(i=1,2,\dots, m\)) are compact with closed range.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic program in Hilbert spaces
    0 references
    convex quadratic constraints
    0 references
    solution existence
    0 references
    Legendre form
    0 references
    recession cone
    0 references
    compact operator with closed range
    0 references
    0 references
    0 references