Dual method of centers for solving generalized fractional programs
From MaRDI portal
Recommendations
- Method of centers for generalized fractional programming
- Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
- A new algorithm for generalized fractional programs
- Prox-regularization of the dual method of centers for generalized fractional programs
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
Cites work
- A new algorithm for generalized fractional programs
- A note on an algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- An algorithm for generalized fractional programs
- An inexact proximal point method for solving generalized fractional programs
- Augmented Lagrange primal-dual approach for generalized fractional programming problems
- Bibliography in fractional programming
- Convergence of interval-type algorithms for generalized fractional programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- Fractional Programming
- Generalized fractional programming and cutting plane algorithms
- Generalized fractional programming duality: A parametric approach
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 7009350 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 3383753 (Why is no real title available?)
- Method of centers for generalized fractional programming
- On general minimax theorems
- On Nonlinear Fractional Programming
- Partial linearization for generalized fractional programming
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
- Prox-regularization methods for generalized fractional programming
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Some properties of methods of centers
- Using duality to solve generalized fractional programming problems
Cited in
(16)- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- A new algorithm for generalized fractional programs
- Using duality to solve generalized fractional programming problems
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Prox-regularization of the dual method of centers for generalized fractional programs
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Method of centers for generalized fractional programming
- Interval division and linearization algorithm for minimax linear fractional program
- Successive upper approximation methods for generalized fractional programs
- Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
- A novel affine relaxation-based algorithm for minimax affine fractional program
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
This page was built for publication: Dual method of centers for solving generalized fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679491)
