An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
DOI10.1080/10556788.2015.1029575zbMATH Open1385.90027OpenAlexW1993244617MaRDI QIDQ2829557FDOQ2829557
Ruey-Lin Sheu, Yong Xia, Van-Bong Nguyen
Publication date: 8 November 2016
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1029575
Recommendations
- On the quadratic fractional optimization with a strictly convex quadratic constraint.
- A semidefinite optimization approach to quadratic fractional optimization with a strictly convex quadratic constraint
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
- On fractional quadratic optimization problem with two quadratic constraints
- SDO relaxation approach to fractional quadratic minimization with one quadratic constraint
generalized trust region subproblemS-lemmasemi-definite relaxationSlater pointDinkelbach algorithmquadratic fractional programmingnon-convex quadratic programmingpositive-definite matrixpencil
Quadratic programming (90C20) Fractional programming (90C32) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- On Nonlinear Fractional Programming
- A Survey of the S-Lemma
- S-lemma with equality and its applications
- New Results on Quadratic Minimization
- The generalized trust region subproblem
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- On Cones of Nonnegative Quadratic Functions
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- On extensions of the Frank-Wolfe theorems
- An algorithm for generalized fractional programs
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Parametric approaches to fractional programs
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- Convergence of interval-type algorithms for generalized fractional programming
- Generic algorithm for generalized fractional programming
- Algorithms for generalized fractional programming
- On minimizing the ratio of quadratic functions over an ellipsoid
Cited In (15)
- Efficient local search procedures for quadratic fractional programming problems
- S-lemma with equality and its applications
- On solving a class of fractional semi-infinite polynomial programming problems
- Geometric properties for level sets of quadratic functions
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
- A survey of hidden convex optimization
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- Title not available (Why is that?)
- Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
- On fractional quadratic optimization problem with two quadratic constraints
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
- Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications
- Solving a Type of the Tikhonov Regularization of the Total Least Squares by a New S-Lemma
This page was built for publication: An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829557)
