Minimizing the sum of many rational functions
From MaRDI portal
Publication:266410
DOI10.1007/s12532-015-0089-zzbMath1364.90268arXiv1102.4954OpenAlexW2118400056MaRDI QIDQ266410
Didier Henrion, Florian Bugarin, Jean-Bernard Lasserre
Publication date: 13 April 2016
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.4954
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
On solving the sum-of-ratios problem, Quadratic tensor eigenvalue complementarity problems, Exploiting term sparsity in noncommutative polynomial optimization, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Fractional programming approach to a cost minimization problem in electricity market, Exploiting sparsity in complex polynomial optimization, Tight relaxations for polynomial optimization and Lagrange multiplier expressions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- 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
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Practical global optimization for multiview geometry
- Global optimization for sum of geometric fractional functions
- A semidefinite programming approach to the generalized problem of moments
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Solving the sum-of-ratios problem by an interior-point method
- A polyhedral branch-and-cut approach to global optimization
- Verifying global minima for \(L_2\) minimization problems in multiple view geometry
- Global optimization of rational functions: a semidefinite programming approach
- Fractional programming: The sum-of-ratios case
- GloptiPoly 3: moments, optimization and semidefinite programming
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Optimization of Polynomials on Compact Semialgebraic Sets
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Global optimization algorithm for the nonlinear sum of ratios problem
