Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares

DOI10.1137/040616851zbMath1115.65065OpenAlexW2163924219MaRDI QIDQ3435006

Amir Beck, Aharon Ben-Tal, Marc Teboulle

Publication date: 3 May 2007

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/521622cde62182b29b257985f8ab3839f31785e4

zbMATH Keywords

algorithmnumerical examplesconvex programmingfractional programmingnonconvex quadratic optimizationregularized total least squares

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Fractional programming (90C32)

Related Items (30)

On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ On box-constrained total least squares problem ⋮ A review of recent advances in global optimization ⋮ Perturbation analysis and condition numbers for the Tikhonov regularization of total least squares problem and their statistical estimation ⋮ A fast algorithm for globally solving Tikhonov regularized total least squares problem ⋮ Efficiently solving total least squares with Tikhonov identical regularization ⋮ Total least-squares regularization of Tykhonov type and an ancient racetrack in Corinth ⋮ An efficient algorithm for solving the generalized trust region subproblem ⋮ Improved design of unimodular waveforms for MIMO radar ⋮ On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint ⋮ A survey of hidden convex optimization ⋮ On the quadratic fractional optimization with a strictly convex quadratic constraint ⋮ Copositivity and constrained fractional quadratic problems ⋮ Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications ⋮ Regularized TLS-EM for estimating missing data ⋮ Efficient determination of the hyperparameter in regularized total least squares problems ⋮ Regularization of linear ill-posed problems with noisy right hand side and noisy operator ⋮ Training Lp norm multiple kernel learning in the primal ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ Graph-based semi-supervised learning by mixed label propagation with a soft constraint ⋮ A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint ⋮ An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels ⋮ Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints ⋮ A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ On a quadratic eigenproblem occurring in regularized total least squares ⋮ Quadratic double-ratio minimax optimization ⋮ Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint ⋮ On minimizing the ratio of quadratic functions over an ellipsoid ⋮ An efficient Gauss-Newton algorithm for solving regularized total least squares problems

Uses Software

• Unnamed Item

This page was built for publication: Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares