Convergence of interval-type algorithms for generalized fractional programming
From MaRDI portal
Publication:1123816
DOI10.1007/BF01582298zbMath0677.90074MaRDI QIDQ1123816
J. C. Bernard, Jacques A. Ferland
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
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, Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem, A proximal point algorithm for generalized fractional programs, A new algorithm for generalized fractional programs, 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, A Fourth bibliography of fractional programming, Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution, Farkas-type results for constrained fractional programming with DC functions, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Continuous-time generalized fractional programming, Algorithms for generalized fractional programming, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Reduction of indefinite quadratic programs to bilinear programs, Method of centers for generalized fractional programming, Processors selection and traffic splitting in a parallel processors system, Revisiting Dinkelbach-type algorithms for generalized fractional programs, 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, An effective branch and bound algorithm for minimax linear fractional programming, Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
Cites Work
- An algorithm for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- 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
- Parametric approaches to fractional programs
- On Nonlinear Fractional Programming
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
