Parametric approaches to fractional programs
From MaRDI portal
Cites work
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
- Duality in Fractional Programming: A Unified Approach
- Experiments with linear fractional problems
- Fractional Programming. II, On Dinkelbach's Algorithm
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3848997 (Why is no real title available?)
- scientific article; zbMATH DE number 3850851 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3614491 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
Cited in
(59)- Solving the sum-of-ratios problem by a stochastic search algorithm
- Generalized fractional programming: Algorithms and numerical experimentation
- Saddle-point type optimality criteria for generalized fractional programming
- Fractional programming revisited
- Analysis of a class of fractional programming problems
- Convergence of interval-type algorithms for generalized fractional programming
- Algorithms for generalized fractional programming
- Global optimization of fractional programs
- Processors selection and traffic splitting in a parallel processors system
- Duality without a constraint qualification for minimax fractional programming
- The inverse-parametric knapsack problem
- A variable neighborhood search heuristic for the maximum ratio clique problem
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Fractional 0-1 programming: applications and algorithms
- Conical partition algorithm for maximizing the sum of dc ratios
- -optimality and duality for multiobjective fractional programming
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- A new algorithm for generalized fractional programs
- On some basic notions of fuzzy parametric nonsmooth multiobjective nonlinear fractional programming problems
- A geometric branch-and-bound algorithm for the service bundle design problem
- Solving a class of feature selection problems via fractional 0--1 programming
- Global optimization for the sum of concave-convex ratios problem
- The maximum ratio clique problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- On fractional programming containing support functions
- Fractional programming with convex quadratic forms and functions
- A global optimization approach to fractional optimal control
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- Fractional programming approach to a cost minimization problem in electricity market
- A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Fractional Programming — Some Recent Developments
- The quickest flow problem
- Tow algorithms for finding a minimal ratio hamiltonian cycle in a network
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- Approximation algorithms for combinatorial fractional programming problems
- Optimality and duality for multiobjective fractional programming involving nonsmooth(si:Fesi:ρ)–convex functions
- First-order algorithms for a class of fractional optimization problems
- The maximum ratio clique problem: A continuous optimization approach and some new results
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Method of centers for generalized fractional programming
- On maximum ratio clique relaxations
- Minimization of isotonic functions composed of Fractions
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- Optimality and duality for a weakly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- Sparse recovery: the square of _1/_2 norms
- Parameterized proximal-gradient algorithms for L1/L2 sparse signal recovery
- Block coordinate Dinkelbach algorithms for solving block-structured constrained fractional optimization problems
- Full splitting algorithms for fractional programs with structured numerators and denominators
- An implementable proximal extragradient method for structured fractional programming
- A single-loop proximal subgradient algorithm for A class structured fractional programs
- On low-rank convex-convex quadratic fractional programming
- Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
- On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations
- An algorithm for generalized fractional programs
- An efficient algorithm for solving convex-convex quadratic fractional programs
This page was built for publication: Parametric approaches to fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744080)
