Convergence of Prox-Regularization Methods for Generalized Fractional Programming

DOI10.1051/RO:2002006zbMATH Open1103.90401OpenAlexW2115193398MaRDI QIDQ3148378FDOQ3148378

Authors: A. Roubi 

Publication date: 2002

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2002__36_1_73_0

Recommendations

• Prox-dual regularization algorithm for generalized fractional programs
• Prox-regularization methods for generalized fractional programming
• Prox-regularization of the dual method of centers for generalized fractional programs
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program
• An inexact proximal point method for solving generalized fractional programs

zbMATH Keywords

rate of convergenceproximal point algorithmDinkelbach-type algorithmsGeneralized fractional programs

Mathematics Subject Classification ID

Fractional programming (90C32) Methods of quasi-Newton type (90C53)

Cites Work

• On Nonlinear Fractional Programming
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Weak Sharp Minima in Mathematical Programming
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• Title not available (Why is that?)
• An algorithm for generalized fractional programs
• Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
• A note on an algorithm for generalized fractional programs
• Method of centers for generalized fractional programming
• Prox-regularization methods for generalized fractional programming

Cited In (20)

• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
• An inexact proximal point method for solving generalized fractional programs
• Dual method of centers for solving generalized fractional programs
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
• Prox-dual regularization algorithm for generalized fractional programs
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
• 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
• A DC approach for minimax fractional optimization programs with ratios of convex functions
• Prox-regularization methods for generalized fractional programming
• A sixth bibliography of fractional programming
• Successive upper approximation methods for generalized fractional programs
• Convergence of interval-type algorithms for generalized fractional programming
• A proximal point algorithm for generalized fractional programs
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program
• Proximal-gradient algorithms for fractional programming
• Prox-regularization of the dual method of centers for generalized fractional programs

This page was built for publication: Convergence of Prox-Regularization Methods for Generalized Fractional Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148378)