Prox-regularization methods for generalized fractional programming
From MaRDI portal
Publication:1969530
DOI10.1023/A:1021759318653zbMath0973.90078OpenAlexW69531596WikidataQ104129324 ScholiaQ104129324MaRDI QIDQ1969530
Publication date: 9 December 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021759318653
linear convergenceill-posed problemsDinkelbach algorithmdifferential correction methodgeneralized fractional programsprox-regularization
Related Items (15)
A proximal point algorithm for generalized fractional programs ⋮ A new linearization technique for minimax linear fractional programming ⋮ Convergence of a proximal algorithm for solving the dual of a generalized fractional program ⋮ Prox-dual regularization algorithm for generalized fractional programs ⋮ Dual method of centers for solving generalized fractional programs ⋮ 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 ⋮ Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs ⋮ Prox-regularization of the dual method of centers for generalized fractional programs ⋮ Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming ⋮ Revisiting Dinkelbach-type algorithms for generalized fractional programs ⋮ An inexact proximal point method for solving generalized fractional programs ⋮ Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs ⋮ A sixth bibliography of fractional programming ⋮ Convergence of Prox-Regularization Methods for Generalized Fractional Programming
Cites Work
This page was built for publication: Prox-regularization methods for generalized fractional programming