Revisiting Dinkelbach-type algorithms for generalized fractional programs
From MaRDI portal
Publication:1021012
DOI10.1007/BF03398807zbMath1178.90322OpenAlexW2774074136MaRDI QIDQ1021012
Jacques A. Ferland, Jean-Pierre Crouzeix, Van Hien Nguyen
Publication date: 5 June 2009
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398807
Related Items
A DC approach for minimax fractional optimization programs with ratios of convex functions, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, 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, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization
Cites Work
- An algorithm for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- Convergence of interval-type algorithms for generalized fractional programming
- Rate of convergence of a generalization of Newton's method
- Prox-regularization methods for generalized fractional programming
- Duality in generalized linear fractional programming
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation