Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
From MaRDI portal
Publication:5151536
DOI10.1080/02331934.2019.1711080OpenAlexW2999664236MaRDI QIDQ5151536
Yong Xia, Xiaoli Cen, Mei-Jia Yang
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1711080
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Fractional programming (90C32)
Uses Software
Cites Work
- Unnamed Item
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Global minimization of a generalized convex multiplicative function
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Semidefinite programming relaxation for nonconvex quadratic programs
- Approximating quadratic programming with bound and quadratic constraints
- Efficiently solving total least squares with Tikhonov identical regularization
- On maximization of quadratic form over intersection of ellipsoids with common center
- A fast algorithm for globally solving Tikhonov regularized total least squares problem
- Tikhonov regularization for infeasible absolute value equations
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Approximation Algorithms and Semidefinite Programming
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- On minimizing the ratio of quadratic functions over an ellipsoid
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- On Nonlinear Fractional Programming
- Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses
This page was built for publication: Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization