Pages that link to "Item:Q1181731"

The following pages link to Algorithms for generalized fractional programming (Q1181731):

Displaying 44 items.

• Robust fractional programming (Q493047) (← links)
• Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming (Q511623) (← links)
• Linear programming system identification (Q706953) (← links)
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios (Q852112) (← links)
• Generic algorithm for generalized fractional programming (Q1029285) (← links)
• Rate of convergence of a generalization of Newton's method (Q1321393) (← links)
• Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• On the posynomial fractional programming problems (Q1848628) (← links)
• Enhanced bisection strategies for the maximin efficiency ratio model (Q1869406) (← links)
• An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
• Generalized fractional programming and cutting plane algorithms (Q1906751) (← links)
• A new algorithm for generalized fractional programs (Q1919091) (← links)
• An algorithm for Chebyshev approximation by rationals with constrained denominators (Q1922536) (← links)
• Using duality to solve generalized fractional programming problems (Q1924069) (← links)
• Prox-regularization methods for generalized fractional programming (Q1969530) (← links)
• A new methodology for solving bi-criterion fractional stochastic programming (Q2062430) (← links)
• Data clustering based on the modified relaxation Cheeger cut model (Q2115038) (← links)
• An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
• Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
• A fast approach to deformable surface 3D tracking (Q2276030) (← links)
• Prox-dual regularization algorithm for generalized fractional programs (Q2411175) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
• Formulating the mixed integer fractional posynomial programming (Q2496065) (← links)
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
• An SDP approach for quadratic fractional problems with a two-sided quadratic constraint (Q2829557) (← links)
• (Q2861545) (← links)
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
• Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control (Q4256100) (← links)
• A fifth bibliography of fractional programming^* (Q4265528) (← links)
• Generalized fractional programming problems containing locally subdifferentiable and<i>ρ</i>-Univex functions (Q4346893) (← links)
• A proximal point algorithm for generalized fractional programs (Q4559394) (← links)
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program (Q4578155) (← links)
• Continuous-time generalized fractional programming (Q4893696) (← links)
• A DC approach for minimax fractional optimization programs with ratios of convex functions (Q5038436) (← links)
• A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
• Radio-frequency chain selection for energy and spectral efficiency maximization in hybrid beamforming under hardware imperfections (Q5161206) (← links)
• Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
• Method of centers for generalized fractional programming (Q5925737) (← links)
• Level function method for quasiconvex programming. (Q5929422) (← links)
• (Q6098205) (← links)