On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
From MaRDI portal
Publication:2174902
DOI10.1007/S11590-018-1320-4zbMath1455.90140OpenAlexW2889187351WikidataQ129316328 ScholiaQ129316328MaRDI QIDQ2174902
Publication date: 27 April 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1320-4
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (3)
On box-constrained total least squares problem ⋮ A survey of hidden convex optimization ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
Cites Work
- Unnamed Item
- S-lemma with equality and its applications
- A linear-time algorithm for trust region problems
- The generalized trust region subproblem
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- On minimizing the ratio of quadratic functions over an ellipsoid
- A Survey of the S-Lemma
This page was built for publication: On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
