A note on an algorithm for generalized fractional programs

DOI10.1007/BF00938484MaRDI QIDQ1062921zbMATH OpenOpenAlexFDO

Authors J.-P. Crouzeix, Jacques A. Ferland, S. Schaible

Publication date 1986

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00938484

zbMATH Keywords

convergence speed improvementmultiratio programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32)

Review text

We present a modification of an algorithm recently suggested by the same authors [ibid. 47, 35-49 (1985; Zbl 0548.90083)]. The speed of convergence is improved for the same complexity of computation.

Recommendations

• An algorithm for generalized fractional programs
• A Fast Algorithm for a Class of Generalized Fractional Programs
• Generalized fractional programming: Algorithms and numerical experimentation
• Convergence of interval-type algorithms for generalized fractional programming
• A new algorithm for generalized fractional programs

Cites work

• An algorithm for generalized fractional programs
• Fractional Programming. II, On Dinkelbach's Algorithm
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• On Nonlinear Fractional Programming
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation

Cited in

(52)

• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• An inexact proximal point method for solving generalized fractional programs
• Generic algorithm for generalized fractional programming
• Convergence of interval-type algorithms for generalized fractional programming
• Algorithms for generalized fractional programming
• A note on a global approach for general 0-1 fractional programming
• Dual method of centers for solving generalized fractional programs
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Preference approach to fuzzy linear inequalities and optimizations
• A new algorithm for generalized fractional programs
• Using duality to solve generalized fractional programming problems
• Quadratic double-ratio minimax optimization
• 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
• Prox-dual regularization algorithm for generalized fractional programs
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
• 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
• 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 4167871 (Why is no real title available?)
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Partial linearization for generalized fractional programming
• Fractional Programming — Some Recent Developments
• Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• A Fourth 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
• Prox-regularization of the dual method of centers for generalized fractional programs
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
• 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
• Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
• Method of centers for generalized fractional programming
• Minimization of isotonic functions composed of Fractions
• Successive upper approximation methods for generalized fractional programs
• Quadratic convex-concave minimax optimization
• On the efficiency of the algorithm for solving complex quadratic double-ratio minimax optimization problem
• Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
• Rational activation functions in neural network with uniform norm based loss function and its application in classification
• Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions
• 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: A note on 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 Q1062921)