A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
From MaRDI portal
Publication:1016108
DOI10.1007/s10107-007-0181-xzbMath1176.90451OpenAlexW2057317983MaRDI QIDQ1016108
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0181-x
convergence analysisstrong dualityfixed point algorithmsregularized total least squaresnonconvex quadratic minimization
Related Items
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ On box-constrained total least squares problem ⋮ Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds ⋮ A fast algorithm for globally solving Tikhonov regularized total least squares problem ⋮ Efficiently solving total least squares with Tikhonov identical regularization ⋮ Unnamed Item ⋮ Efficient algorithms for solving nonlinear fractional programming problems ⋮ On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint ⋮ A survey of hidden convex optimization ⋮ New results on multi-dimensional linear discriminant analysis ⋮ On the quadratic fractional optimization with a strictly convex quadratic constraint ⋮ Copositivity and constrained fractional quadratic problems ⋮ (Global) optimization: historical notes and recent developments ⋮ On the indefinite quadratic fractional optimization with two quadratic constraints ⋮ Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint ⋮ Optimal error correction and methods of feasible directions ⋮ Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ Quadratic double-ratio minimax optimization ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem ⋮ An SDP approach for quadratic fractional problems with a two-sided quadratic constraint ⋮ On minimizing the ratio of quadratic functions over an ellipsoid
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Convexity of quadratic transformations and its use in control and optimization
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- Regularized total least squares based on quadratic eigenvalue problem solvers
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Lectures on Modern Convex Optimization
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- New Results on Quadratic Minimization
- Efficient Algorithms for Solution of Regularized Total Least Squares
- The trust region subproblem and semidefinite programming*
- Tikhonov Regularization and Total Least Squares
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Quadratic Matrix Programming
- On Nonlinear Fractional Programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
