Dual method of centers for solving generalized fractional programs
From MaRDI portal
Publication:1679491
DOI10.1007/s10898-017-0523-zzbMath1373.90159OpenAlexW2605892009MaRDI QIDQ1679491
Publication date: 9 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0523-z
Numerical methods involving duality (49M29) Fractional programming (90C32) Numerical methods based on nonlinear programming (49M37) Optimality conditions for minimax problems (49K35)
Related Items (10)
A DC approach for minimax fractional optimization programs with ratios of convex functions ⋮ Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs ⋮ Interval division and linearization algorithm for minimax linear fractional program ⋮ Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution ⋮ Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs ⋮ Prox-regularization of the dual method of centers for generalized fractional programs ⋮ Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions ⋮ Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Augmented Lagrange primal-dual approach for generalized fractional programming problems
- On general minimax theorems
- An algorithm for generalized fractional programs
- An inexact proximal point method for solving generalized fractional programs
- A note on an algorithm for generalized fractional programs
- Generalized fractional programming duality: A parametric approach
- Convergence of interval-type algorithms for generalized fractional programming
- Duality in generalized fractional programming via Farkas' lemma
- Algorithms for generalized fractional programming
- Generalized fractional programming and cutting plane algorithms
- A new algorithm for generalized fractional programs
- Using duality to solve generalized fractional programming problems
- Prox-regularization methods for generalized fractional programming
- Duality in generalized linear fractional programming
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- Partial linearization for generalized fractional programming
- Bibliography in fractional programming
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
- On Nonlinear Fractional Programming
- Fractional Programming
- Method of centers for generalized fractional programming
- Some properties of methods of centers
This page was built for publication: Dual method of centers for solving generalized fractional programs