Fractional Programming. II, On Dinkelbach's Algorithm
From MaRDI portal
Publication:4116271
Cited in
(50)- Solving sum of quadratic ratios fractional programs via monotonic function
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- A note on an algorithm for generalized fractional programs
- A new look at fractional programming
- Analysis of a class of fractional programming problems
- Fractional programming: Applications and algorithms
- Algorithms for generalized fractional programming
- Global optimization of fractional programs
- Rate of convergence of a generalization of Newton's method
- Efficiently solving total least squares with Tikhonov identical regularization
- Some dual characterizations of Farkas-type results for fractional programming problems
- Fractional 0-1 programming: applications and algorithms
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- On fractional vector optimization over cones with support functions
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Fractional optimization problems
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Partial linearization for generalized fractional programming
- Bibliography in fractional programming
- Parametric approaches to fractional programs
- Robust fractional programming
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- A Solution Strategy for a Class of Nonlinear Knapsack Problems
- Global optimization for the generalized polynomial sum of ratios problem
- C-programming and the minimization of pseudolinear and additive concave functions
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Fractional programming
- Fractional programming
- Lifting, tilting and fractional programming revisited
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- Distributionally robust fractional optimization of probability of exceedance
- Block coordinate Dinkelbach algorithms for solving block-structured constrained fractional optimization problems
- Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
- Globally maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold
- Estimating average treatment effects with support vector machines
- Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
- Edge expansion of a graph: SDP-based computational strategies
- Localization of complementarity eigenvalues
- On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations
- An algorithm for generalized fractional programs
- On the convexification of nonlinear programming problems: An applications-oriented survey
- Within-group common weights in DEA: an analysis of power plant efficiency
- Convexification of nonsmooth monotone functions
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Supervised dimensionality reduction via sequential semidefinite programming
This page was built for publication: Fractional Programming. II, On Dinkelbach's Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4116271)
