On subspace properties of the quadratically constrained quadratic program
From MaRDI portal
Publication:2411152
DOI10.3934/jimo.2017010zbMath1377.49033OpenAlexW2560548793MaRDI QIDQ2411152
Publication date: 20 October 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017010
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Applications of second-order cone programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Dual estimates in multiextremal problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Subspace choices for the Celis-Dennis-Tapia problem
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Quadratically constrained quadratic programming: Some applications and a method for solution
- A Cutting Plane Approach for Chance Constrained Linear Programs
- Semidefinite Programming
This page was built for publication: On subspace properties of the quadratically constrained quadratic program
