Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
From MaRDI portal
Publication:1206605
DOI10.1016/0377-2217(92)90059-IzbMath0763.90070OpenAlexW1994547505MaRDI QIDQ1206605
Wiesława T. Obuchowska, Richard J. Caron
Publication date: 1 April 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90059-i
Related Items
Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems, Unboundedness in reverse convex and concave integer programming, Feasibility in reverse convex mixed-integer programming, Feasible partition problem in reverse convex and convex mixed-integer programming, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, Conditions for boundedness in concave programming under reverse convex and convex constraints, Quadratically constrained convex quadratic programmes: Faculty feasible regions, Second-order global optimality conditions for convex composite optimization, Convex constrained programmes with unattained infima
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
- Numerical solution of a non-linear ill-posed problem arising in inverse scattering
- Quadratically constrained quadratic programming: Some applications and a method for solution
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- Controlled perturbations for quadratically constrained quadratic programs
- A Dual Method for Quadratic Programs with Quadratic Constraints