On minimizing the ratio of quadratic functions over an ellipsoid

DOI10.1080/02331934.2013.840623zbMath1311.90097OpenAlexW2029096466MaRDI QIDQ5248226

Yong Xia

Publication date: 28 April 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.840623

zbMATH Keywords

semidefinite programmingnonconvex quadratic minimizationratio of quadratic minimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items (6)

On box-constrained total least squares problem ⋮ On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint ⋮ Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem ⋮ Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization ⋮ A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint ⋮ An SDP approach for quadratic fractional problems with a two-sided quadratic constraint

Cites Work

• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
• Convexity of quadratic transformations and its use in control and optimization
• 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
• Generalized Inversion of Modified Matrices
• A Survey of the S-Lemma

This page was built for publication: On minimizing the ratio of quadratic functions over an ellipsoid