Pages that link to "Item:Q2423806"

The following pages link to Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806):

Displaying 10 items.

• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← 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)
• Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs (Q2315615) (← links)
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
• (Q3385928) (← 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)
• Successive upper approximation methods for generalized fractional programs (Q6658432) (← links)