Efficient local search procedures for quadratic fractional programming problems
From MaRDI portal
Publication:1986108
DOI10.1007/s10589-020-00175-1zbMath1433.90167OpenAlexW3005179164MaRDI QIDQ1986108
Yong Xia, Luca Consolini, Jiulin Wang, Marco Locatelli
Publication date: 7 April 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00175-1
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Fractional programming (90C32)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Approximation of linear fractional-multiplicative problems
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Global optimization of nonlinear sum of ratios problem
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Definite and semidefinite matrices in a real symmetric matrix pencil
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Handbook of global optimization
- Solving the sum-of-ratios problem by an interior-point method
- Deconvolution and regularization with Toeplitz matrices
- Efficiently solving total least squares with Tikhonov identical regularization
- Large-scale Tikhonov regularization of total least squares
- On the complexity of quadratic programming with two quadratic constraints
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Solving sum of ratios fractional programs via concave minimization
- \(NP\)-hardness of linear multiplicative programming and related problems
- Regularized total least squares based on quadratic eigenvalue problem solvers
- A Note on Polynomial Solvability of the CDT Problem
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Alternative branching rules for some nonconvex problems
- Fractional programming: The sum-of-ratios case
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- Regularized Total Least Squares: Computational Aspects and Error Bounds
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Regularization by Truncated Total Least Squares
- Tikhonov Regularization and Total Least Squares
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- On Nonlinear Fractional Programming
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Global optimization of nonlinear sums of ratios
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: Efficient local search procedures for quadratic fractional programming problems
