Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
From MaRDI portal
Publication:2810107
DOI10.1080/02331934.2015.1113532zbMath1384.90101OpenAlexW2316962996MaRDI QIDQ2810107
Publication date: 31 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2015.1113532
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Fractional programming (90C32)
Related Items (5)
Generating the efficient set of multiobjective integer linear plus linear fractional programming problems ⋮ Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds ⋮ A survey of hidden convex optimization ⋮ Quadratic double-ratio minimax optimization ⋮ A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
Cites Work
- Unnamed Item
- Robust delay-constrained routing in telecommunications
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- On the global optimization of sums of linear fractional functions over a convex set
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A sequential method for a class of pseudoconcave fractional problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A globally convergent method for nonlinear programming
- A note on a global approach for general 0-1 fractional programming
- Global minimization of a generalized convex multiplicative function
- A global approach for general \(0-1\) fractional programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Fractional programming with convex quadratic forms and functions
- \(NP\)-hardness of linear multiplicative programming and related problems
- Solving sum-of-ratios fractional programs using efficient points
- Lectures on Modern Convex Optimization
- On Maximizing a Sum of Ratios
- A note on the sum of a linear and linear-fractional function
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Deterministic algorithms for constrained concave minimization: A unified critical survey
- On the Pseudoconvexity of a Quadratic Fractional Function
- Programming with linear fractional functionals
- A Rapidly Convergent Descent Method for Minimization
- On the pseudoconvexity and pseudolinearity of some classes of fractional functions
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- On the polynomial mixed 0-1 fractional programming problems
This page was built for publication: Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
