Approximation algorithms for indefinite quadratic programming
Mathematical Programming: Series A and B
Some optimal inapproximability results
Journal of the ACM (JACM)
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
Journal of Global Optimization
A PTAS for the minimization of polynomials of fixed degree over the simplex
Theoretical Computer Science - Approximation and online algorithms
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications)
Quadratic programming and combinatorial minimum weight product problems
Mathematical Programming: Series A and B
A FPTAS for a class of linear multiplicative problems
Computational Optimization and Applications
Approximation of linear fractional-multiplicative problems
Mathematical Programming: Series A and B
| Hi-index | 0.00 |
In this paper we develop and derive the computational cost of an $${\varepsilon}$$ -approximation algorithm for a class of global optimization problems, where a suitably defined composition of some ratio functions is minimized over a convex set. The result extends a previous one about a class of Linear Fractional/Multiplicative problems.