An algorithm for generalized fractional programs
From MaRDI portal
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. II, On Dinkelbach's Algorithm
- Fractional programming
- Fractional programming
- 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)- 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
- Nonsmooth minimax programming problems with \(V\)-\(r\)-invex functions
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems
- A new linearization technique for minimax linear fractional programming
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- Simplex-like sequential methods for a class of generalized fractional programs
- A fuzzy approach using generalized Dinkelbach's algorithm for multiobjective linear fractional transportation problem
- Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
- Generalized fractional programming duality: A parametric approach
- Saddle-point type optimality criteria for generalized fractional programming
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Optimality and duality for nonsmooth minimax programming problems using convexifactor
- A new algorithm for generalized fractional programs
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Method of centers for generalized fractional programming
- Duality in generalized nonlinear fractional programming
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Mixed duality without a constraint qualification for minimax fractional programming
- A novel affine relaxation-based algorithm for minimax affine fractional program
- An inexact proximal point method for solving generalized fractional programs
- Duality for generalized fractional programs involving n-set functions
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- Interval division and linearization algorithm for minimax linear fractional program
- Enhanced bisection strategies for the maximin efficiency ratio model
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A combined algorithm for fractional programming
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- scientific article; zbMATH DE number 4176854 (Why is no real title available?)
- Linear programming system identification
- On quality concepts fractional programming
- Fractional programming
- Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Dual method of centers for solving generalized fractional programs
- Partial linearization for generalized fractional programming
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Minimax programming under (p,r)-invexity
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Fractional Programming — Some Recent Developments
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- Saddle-point type optimality criteria and duality relations for generalized fractional programming.
- A Cutting Plane Algorithm for Min-Max Fractional Programming
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Parametric optimality and duality results for nondifferentiable L-univex multiobjective fractional programming problems
- An interior-point method for multifractional programs with convex constraints
- On a dynamic fractional game
- Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions
- Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem
- Optimality and duality results for fractional programming problems under E-univexity
- Partial vector invexity and fractional minmax problem
- Continuous min-max programs with semi-infinite constraints
- 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
- Prox-dual regularization algorithm for generalized fractional programs
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity
- Approximation algorithms for combinatorial fractional programming problems
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Minimization of isotonic functions composed of Fractions
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
- An effective branch and bound algorithm for minimax linear fractional programming
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- On the optimality and duality in nonsmooth multiobjective fractional optimization problems via higher-order E-convexity
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- Parametric approach to multitime multiobjective fractional variational problems under (F,)-convexity
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
- Quadratic convex-concave minimax optimization
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- Continuous-time generalized fractional programming
- Minimax programming under generalized (p, r)-invexity
- A Fourth bibliography of fractional programming
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Duality without a constraint qualification for minimax fractional programming
- Quadratic double-ratio minimax optimization
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- scientific article; zbMATH DE number 4167871 (Why is no real title available?)
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- A new branch and bound algorithm for minimax ratios problems
- A fast approach to deformable surface 3D tracking
- Robust 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)
