An algorithm for generalized fractional programs
From MaRDI portal
An algorithm is suggested that finds the constrained minimum of the maximum of finitely many ratios. The method involves a sequence of linear (convex) subproblems if the ratios are linear (convex-concave). Convergence results as well as rate of convergence results are derived. Special consideration is given to the case of (a) compact feasible regions and (b) linear ratios.
Recommendations
- A new algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- A note on an algorithm for generalized fractional programs
- Generic algorithm for generalized fractional programming
- A Fast Algorithm for a Class of Generalized Fractional Programs
- Generalized fractional programming: Algorithms and numerical experimentation
- An \(\varepsilon\)-approximation algorithm for generalized fractional programs
- scientific article; zbMATH DE number 4167871
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
Cites work
- Bibliography in fractional programming
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- Fractional programming
- Fractional programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Goal programming and multiple objective optimizations. Part I
- On Nonlinear Fractional Programming
- Parametric approaches to fractional programs
Cited in
(only showing first 100 items - show all)- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- An inexact proximal point method for solving generalized fractional programs
- Generic algorithm for generalized fractional programming
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint
- Saddle-point type optimality criteria for generalized fractional programming
- Generalized fractional programming duality: A parametric approach
- Convergence of interval-type algorithms for generalized fractional programming
- Algorithms for generalized fractional programming
- Duality in generalized nonlinear fractional programming
- Duality without a constraint qualification for minimax fractional programming
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
- Dual method of centers for solving generalized fractional programs
- A fuzzy approach using generalized Dinkelbach's algorithm for multiobjective linear fractional transportation problem
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Minimax programming under (p,r)-invexity
- Enhanced bisection strategies for the maximin efficiency ratio model
- An interior-point method for multifractional programs with convex constraints
- Generalized fractional programming and cutting plane algorithms
- A new algorithm for generalized fractional programs
- Using duality to solve generalized fractional programming problems
- Three types dual model for minimax fractional programming
- An iterative approach to solve multiobjective linear fractional programming problems
- Quadratic double-ratio minimax optimization
- Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- A fast approach to deformable surface 3D tracking
- Duality for generalized fractional programs involving n-set functions
- An effective branch and bound algorithm for minimax linear fractional programming
- A new branch and bound algorithm for minimax ratios problems
- Prox-dual regularization algorithm for generalized fractional programs
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Minimax programming under generalized (p, r)-invexity
- Saddle-point type optimality criteria and duality relations for generalized fractional programming.
- Partial vector invexity and fractional minmax problem
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Parametric approach to multitime multiobjective fractional variational problems under (F,)-convexity
- A new linearization technique for minimax linear fractional programming
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- scientific article; zbMATH DE number 4176854 (Why is no real title available?)
- Continuous min-max programs with semi-infinite constraints
- scientific article; zbMATH DE number 4167871 (Why is no real title available?)
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- Nonsmooth minimax programming problems with \(V\)-\(r\)-invex functions
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Partial linearization for generalized fractional programming
- Fractional Programming — Some Recent Developments
- On Maximizing a Sum of Ratios
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- A Cutting Plane Algorithm for Min-Max Fractional Programming
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- On quality concepts fractional programming
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
- A Fourth bibliography of fractional programming
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- A Fast Algorithm for a Class of Generalized Fractional Programs
- Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions
- Mixed duality without a constraint qualification for minimax fractional programming
- A proximal point algorithm for generalized fractional programs
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Prox-regularization of the dual method of centers for generalized fractional programs
- Approximation algorithms for combinatorial fractional programming problems
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- scientific article; zbMATH DE number 1864569 (Why is no real title available?)
- Continuous-time generalized fractional programming
- Optimality and duality for multiobjective fractional programming involving nonsmooth(si:Fesi:ρ)–convex functions
- Robust fractional programming
- Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem
- Optimality and duality for nonsmooth minimax programming problems using convexifactor
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- Simplex-like sequential methods for a class of generalized fractional programs
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Parametric nondifferentiable multiobjective fractional programming under \((b,\Psi,\Phi,\rho)\)-univexity
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Fractional programming
- Method of centers for generalized fractional programming
- A combined algorithm for fractional programming
- On a dynamic fractional game
- Minimization of isotonic functions composed of Fractions
- Interval division and linearization algorithm for minimax linear fractional program
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
This page was built for publication: An algorithm for generalized fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799495)
