Pages that link to "Item:Q3148378"

The following pages link to Convergence of Prox-Regularization Methods for Generalized Fractional Programming (Q3148378):

Displaying 16 items.

• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
• An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
• Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← 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)
• 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)
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
• A sixth bibliography of fractional programming (Q3426331) (← 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)
• A DC approach for minimax fractional optimization programs with ratios of convex functions (Q5038436) (← links)
• Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)