Convergence of a Dinkelbach-type algorithm in generalized fractional programming
From MaRDI portal
Publication:3760313
Recommendations
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Convergence of interval-type algorithms for generalized fractional programming
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- Generalized fractional programming and cutting plane algorithms
Cites work
- scientific article; zbMATH DE number 3614491 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- A first course in numerical analysis.
- A note on an algorithm for generalized fractional programs
- An algorithm for generalized fractional programs
- Bibliography in fractional programming
- Determination of the inertia of a partitioned Hermitian matrix
- Duality in generalized linear fractional programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fractional programming
- Fractional programming: Applications and algorithms
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- Generalized fractional programming: Algorithms and numerical experimentation
- Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
- On Nonlinear Fractional Programming
- Programming with linear fractional functionals
- Sensitivity analysis for nonlinear programming using penalty methods
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
Cited in
(22)- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- 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
- Interval division and linearization algorithm for minimax linear fractional program
- Fractional programming by lower subdifferentiability techniques
- Partial linearization for generalized fractional programming
- Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic 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
- 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
- A new branch and bound algorithm for minimax ratios problems
- Convergence of interval-type algorithms for generalized fractional programming
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Algorithms for generalized fractional programming
- An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
- A fuzzy approach using generalized Dinkelbach's algorithm for multiobjective linear fractional transportation problem
This page was built for publication: Convergence of a Dinkelbach-type algorithm in generalized fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760313)
