Fractional Programming. II, On Dinkelbach's Algorithm
From MaRDI portal
Publication:4116271
DOI10.1287/MNSC.22.8.868zbMATH Open0346.90052OpenAlexW1999218360MaRDI QIDQ4116271FDOQ4116271
Authors: S. Schaible
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.22.8.868
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cited In (41)
- Rate of convergence of a generalization of Newton's method
- A Solution Strategy for a Class of Nonlinear Knapsack Problems
- Fractional programming
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- Fractional programming
- Fractional optimization problems
- Partial linearization for generalized fractional programming
- Parametric approaches to fractional programs
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Fractional 0-1 programming: applications and algorithms
- Efficiently solving total least squares with Tikhonov identical regularization
- C-programming and the minimization of pseudolinear and additive concave functions
- Supervised dimensionality reduction via sequential semidefinite programming
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
- Global optimization of fractional programs
- A new look at fractional programming
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Bibliography in fractional programming
- Within-group common weights in DEA: an analysis of power plant efficiency
- Some dual characterizations of Farkas-type results for fractional programming problems
- On fractional vector optimization over cones with support functions
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Fractional programming: Applications and algorithms
- Global optimization for the generalized polynomial sum of ratios problem
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Solving sum of quadratic ratios fractional programs via monotonic function
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Robust fractional programming
- Lifting, tilting and fractional programming revisited
- An algorithm for generalized fractional programs
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- On the convexification of nonlinear programming problems: An applications-oriented survey
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Convexification of nonsmooth monotone functions
- A note on an algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
- Analysis of a class of fractional programming problems
This page was built for publication: Fractional Programming. II, On Dinkelbach's Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4116271)