On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint

DOI10.1007/S11590-018-1320-4MaRDI QIDQ2174902zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

quadratic programmingtotal least squaresfractional programmingLagrangian duality

Mathematics Subject Classification ID

Quadratic programming (90C20) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)

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

Cites work

• scientific article; zbMATH DE number 3368525 (Why is no real title available?)
• A Survey of the S-Lemma
• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
• A linear-time algorithm for the trust region subproblem based on hidden convexity
• A linear-time algorithm for trust region problems
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
• Efficient Algorithms for Solution of Regularized Total Least Squares
• Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• On minimizing the ratio of quadratic functions over an ellipsoid
• S-lemma with equality and its applications
• Strong duality for generalized trust region subproblem: S-lemma with interval bounds
• The generalized trust region subproblem

Cited in

(5)

• An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
• On box-constrained total least squares problem
• A survey of hidden convex optimization
• Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
• 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)