An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
DOI10.1080/10556788.2015.1029575zbMath1385.90027OpenAlexW1993244617MaRDI QIDQ2829557
Ruey-Lin Sheu, Yong Xia, Van-Bong Nguyen
Publication date: 8 November 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1029575
S-lemmasemi-definite relaxationgeneralized trust region subproblemSlater pointDinkelbach algorithmquadratic fractional programmingnon-convex quadratic programmingpositive-definite matrixpencil
Integer programming (90C10) Quadratic programming (90C20) Fractional programming (90C32) Boolean programming (90C09)
Related Items (14)
Cites Work
- S-lemma with equality and its applications
- The generalized trust region subproblem
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
- An algorithm for generalized fractional programs
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Generic algorithm for generalized fractional programming
- Convergence of interval-type algorithms for generalized fractional programming
- Algorithms for generalized fractional programming
- On extensions of the Frank-Wolfe theorems
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- New Results on Quadratic Minimization
- Parametric approaches to fractional programs
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- On minimizing the ratio of quadratic functions over an ellipsoid
- On Nonlinear Fractional Programming
- On Cones of Nonnegative Quadratic Functions
- A Survey of the S-Lemma
This page was built for publication: An SDP approach for quadratic fractional problems with a two-sided quadratic constraint