Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
From MaRDI portal
Publication:3706860
DOI10.1287/moor.10.4.674zbMath0583.90088OpenAlexW2120463209MaRDI QIDQ3706860
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.4.674
second order convergencedifferential correction algorithmextended fractional max-min and fractional Pareto extremum problemsgeneralized Cheney-Loeb-Dinkelbach- type algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Fractional programming (90C32) Numerical methods based on nonlinear programming (49M37)
Related Items (19)
Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control ⋮ An interior-point method for multifractional programs with convex constraints ⋮ Optimality conditions and duality for a class of continuous-time generalized fractional programming problems ⋮ A new algorithm for generalized fractional programs ⋮ Convergence of interval-type algorithms for generalized fractional programming ⋮ Convergence of a Dinkelbach-type algorithm in generalized fractional programming ⋮ A Fourth bibliography of fractional programming ⋮ Partial linearization for generalized fractional programming ⋮ Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint ⋮ Continuous-time generalized fractional programming ⋮ Algorithms for generalized fractional programming ⋮ Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions ⋮ A fast approach to deformable surface 3D tracking ⋮ Duality for generalized fractional programs involving n-set functions ⋮ Revisiting Dinkelbach-type algorithms for generalized fractional programs ⋮ Quadratic double-ratio minimax optimization ⋮ Generalized fractional programming: Algorithms and numerical experimentation ⋮ A note on an algorithm for generalized fractional programs ⋮ Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
This page was built for publication: Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
