Quadratic double-ratio minimax optimization
From MaRDI portal
Publication:2060599
DOI10.1016/j.orl.2021.06.001OpenAlexW3169885538MaRDI QIDQ2060599
Yong Xia, Arezu Zare, Ali Reza Ashrafi
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2021.06.001
minimax optimizationglobal optimizationquadratic programmingsemidefinite programmingfractional programming
Related Items (1)
Cites Work
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- An algorithm for generalized fractional programs
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- A note on an algorithm for generalized fractional programs
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Efficient local search procedures for quadratic fractional programming problems
- Lectures on Modern Convex Optimization
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Programming with linear fractional functionals
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
- On Nonlinear Fractional Programming
This page was built for publication: Quadratic double-ratio minimax optimization