Generalized Cheney-Loeb-Dinkelbach-Type Algorithms

DOI10.1287/MOOR.10.4.674MaRDI QIDQ3706860zbMATH OpenOpenAlexFDO

Authors Jacob Flachs

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

zbMATH Keywords

differential correction algorithmsecond order convergenceextended fractional max-min and fractional Pareto extremum problemsgeneralized Cheney-Loeb-Dinkelbach- type algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• Generalization of the Dinkelbach-type algorithm for generalized fractional programming
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Generalized fractional programming: Algorithms and numerical experimentation
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios

Cited in

(23)

• A generalization of the Massey-Ding algorithm
• A new algorithm for generalized fractional programs
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
• Duality for generalized fractional programs involving n-set functions
• Partial linearization for generalized fractional programming
• An interior-point method for multifractional programs with convex constraints
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
• Quadratic convex-concave minimax optimization
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
• Continuous-time generalized fractional programming
• A Fourth bibliography of fractional programming
• Quadratic double-ratio minimax optimization
• A fast approach to deformable surface 3D tracking
• Convergence of interval-type algorithms for generalized fractional programming
• A note on an algorithm for generalized fractional programs
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• On the efficiency of the algorithm for solving complex quadratic double-ratio minimax optimization problem
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• Generalized fractional programming: Algorithms and numerical experimentation
• Algorithms for generalized fractional programming
• Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint
• A generalization of Takane's algorithm for DEDICOM

This page was built for publication: Generalized Cheney-Loeb-Dinkelbach-Type Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706860)