Algorithms for generalized fractional programming
From MaRDI portal
For the problem of minimizing the maximum of a finite number of ratios of functions various algorithmic approaches are reviewed, contrasted and their convergence properties and relative computational efficiency are discussed.
Recommendations
- An algorithm for generalized fractional programs
- Generic algorithm for generalized fractional programming
- Generalized fractional programming: Algorithms and numerical experimentation
- A new algorithm for generalized fractional programs
- A note on an algorithm for generalized fractional programs
- A Fast Algorithm for a Class of Generalized Fractional Programs
- Generalized fractional programming
- scientific article; zbMATH DE number 1377931
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
Cites work
- A note on an algorithm for generalized fractional programs
- A Parametric Method for Solving the Linear Fractional Programming Problem
- An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
- An algorithm for generalized fractional programs
- Bibliography in fractional programming
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Convergence of interval-type algorithms for generalized fractional programming
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- Fractional programming revisited
- Fractional Programming. II, On Dinkelbach's Algorithm
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- Generalized fractional programming: Algorithms and numerical experimentation
- scientific article; zbMATH DE number 3850851 (Why is no real title available?)
- On Nonlinear Fractional Programming
- Parametric approaches to fractional programs
- Partial linearization for generalized fractional programming
- Sensitivity analysis for nonlinear programming using penalty methods
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Two new algorithms for rational approximation
Cited in
(60)- Generic algorithm for generalized fractional programming
- Generalized fractional programming: Algorithms and numerical experimentation
- Rate of convergence of a generalization of Newton's method
- Dual method of centers for solving generalized fractional programs
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- On the posynomial fractional programming problems
- 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
- An algorithm for Chebyshev approximation by rationals with constrained denominators
- Using duality to solve generalized fractional programming problems
- Prox-regularization methods for generalized fractional programming
- A new methodology for solving bi-criterion fractional stochastic programming
- Data clustering based on the modified relaxation Cheeger cut model
- 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
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- A fast approach to deformable surface 3D tracking
- Prox-dual regularization algorithm for generalized fractional programs
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Formulating the mixed integer fractional posynomial programming
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Optimal routing for minimizing the maximal link congestion
- 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
- scientific article; zbMATH DE number 4167871 (Why is no real title available?)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
- A fifth bibliography of fractional programming*
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- A Fast Algorithm for a Class of Generalized Fractional Programs
- A proximal point algorithm for generalized fractional programs
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Approximation algorithms for combinatorial fractional programming problems
- scientific article; zbMATH DE number 1864569 (Why is no real title available?)
- Continuous-time generalized fractional programming
- Robust fractional programming
- 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
- Efficient algorithms for solving nonlinear fractional programming problems
- Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming
- Radio-frequency chain selection for energy and spectral efficiency maximization in hybrid beamforming under hardware imperfections
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Method of centers for generalized fractional programming
- Level function method for quasiconvex programming.
- Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction
- Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
- Minimization of isotonic functions composed of Fractions
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- Sparse recovery: the square of _1/_2 norms
- Successive upper approximation methods for generalized fractional programs
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
- Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
- Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions
- Linear programming system identification
- An algorithm for generalized fractional programs
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
This page was built for publication: Algorithms for generalized fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181731)
