Algorithms for generalized fractional programming

DOI10.1007/BF01582887zbMath0748.90067MaRDI QIDQ1181731

Jean-Pierre Crouzeix, Jacques A. Ferland

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

computational efficiencyminimizing the maximum of a finite number of ratios

Mathematics Subject Classification ID

Nonlinear programming (90C30) Fractional programming (90C32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A DC approach for minimax fractional optimization programs with ratios of convex functions, Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, A fifth bibliography of fractional programming^*, An interior-point method for multifractional programs with convex constraints, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints, Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios, Generalized fractional programming and cutting plane algorithms, A proximal point algorithm for generalized fractional programs, A new algorithm for generalized fractional programs, An algorithm for Chebyshev approximation by rationals with constrained denominators, Convergence of a proximal algorithm for solving the dual of a generalized fractional program, Using duality to solve generalized fractional programming problems, Prox-dual regularization algorithm for generalized fractional programs, Dual method of centers for solving generalized fractional programs, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems, Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution, Unnamed Item, Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions, Prox-regularization methods for generalized fractional programming, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Continuous-time generalized fractional programming, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Robust fractional programming, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, 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, Method of centers for generalized fractional programming, Level function method for quasiconvex programming., Linear programming system identification, Unnamed Item, Formulating the mixed integer fractional posynomial programming, Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations, A fast approach to deformable surface 3D tracking, Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming, A new methodology for solving bi-criterion fractional stochastic programming, An SDP approach for quadratic fractional problems with a two-sided quadratic constraint, Generic algorithm for generalized fractional programming, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, On the posynomial fractional programming problems, Rate of convergence of a generalization of Newton's method, Data clustering based on the modified relaxation Cheeger cut model, Enhanced bisection strategies for the maximin efficiency ratio model

Cites Work

• Unnamed Item
• An algorithm for generalized fractional programs
• Generalized fractional programming: Algorithms and numerical experimentation
• A note on an algorithm for generalized fractional programs
• Fractional programming revisited
• Convergence of interval-type algorithms for generalized fractional programming
• Duality in generalized fractional programming via Farkas' lemma
• Two new algorithms for rational approximation
• Duality in generalized linear fractional programming
• A Parametric Method for Solving the Linear Fractional Programming Problem
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Partial linearization for generalized fractional programming
• Bibliography in fractional programming
• Fractional Programming. II, On Dinkelbach's Algorithm
• Sensitivity analysis for nonlinear programming using penalty methods
• Parametric approaches to fractional programs
• On Nonlinear Fractional Programming
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation