Pages that link to "Item:Q1062921"

The following pages link to A note on an algorithm for generalized fractional programs (Q1062921):

Displaying 41 items.

• Robust fractional programming (Q493047) (← links)
• Minimization of isotonic functions composed of Fractions (Q613584) (← 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)
• Revisiting Dinkelbach-type algorithms for generalized fractional programs (Q1021012) (← links)
• An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
• Convergence of interval-type algorithms for generalized fractional programming (Q1123816) (← links)
• Algorithms for generalized fractional programming (Q1181731) (← links)
• Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• Preference approach to fuzzy linear inequalities and optimizations (Q1774608) (← links)
• A new algorithm for generalized fractional programs (Q1919091) (← links)
• Using duality to solve generalized fractional programming problems (Q1924069) (← links)
• Quadratic double-ratio minimax optimization (Q2060599) (← 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)
• A fast approach to deformable surface 3D tracking (Q2276030) (← links)
• Duality for generalized fractional programs involving n-set functions (Q2276888) (← 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)
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems (Q2639330) (← links)
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
• Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint (Q2700113) (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
• Convergence of Prox-Regularization Methods for Generalized Fractional Programming (Q3148378) (← links)
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming (Q3760313) (← links)
• Partial linearization for generalized fractional programming (Q3786297) (← links)
• Fractional Programming — Some Recent Developments (Q3832343) (← links)
• Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program (Q3832346) (← links)
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions (Q3833882) (← links)
• A Fourth bibliography of fractional programming (Q4327876) (← 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)
• Prox-regularization of the dual method of centers for generalized fractional programs (Q4631765) (← links)
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions (Q4764579) (← 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)
• 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)