On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
DOI10.1007/S11590-018-1320-4zbMATH Open1455.90140OpenAlexW2889187351WikidataQ129316328 ScholiaQ129316328MaRDI QIDQ2174902FDOQ2174902
Authors: Yong Xia, Mei-Jia Yang 
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
Recommendations
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- Duality gap estimation of linear equality constrained binary quadratic programming
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
Quadratic programming (90C20) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- A Survey of the S-Lemma
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- S-lemma with equality and its applications
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- The generalized trust region subproblem
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds
- Title not available (Why is that?)
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A linear-time algorithm for trust region problems
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- 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
- On minimizing the ratio of quadratic functions over an ellipsoid
- A linear-time algorithm for the trust region subproblem based on hidden convexity
Cited In (5)
- On box-constrained total least squares problem
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- A survey of hidden convex optimization
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
This page was built for publication: On Lagrangian duality gap of quadratic fractional programming 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 Q2174902)
