Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
DOI10.1007/s10898-019-00780-3zbMath1434.90216OpenAlexW2944395221WikidataQ127901263 ScholiaQ127901263MaRDI QIDQ2274881
Immanuel M. Bomze, Paula Amaral
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00780-3
lower boundscopositive conecompletely positive coneconic reformulationsmin-max fractional quadratic problems
Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositivity and constrained fractional quadratic problems
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- An algorithm for the global optimization of a class of continuous minimax problems
- An algorithm for convex constrained minimax optimization based on duality
- Algorithms for generalized fractional programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On a class of differential games
- Some NP-complete problems in quadratic and nonlinear programming
- Partial linearization for generalized fractional programming
- Calculation of Investment Portfolios with Risk Free Borrowing and Lending
- Fractional Programming. I, Duality
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Cluster Analysis and Mathematical Programming
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
This page was built for publication: Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations