Convergence of Prox-Regularization Methods for Generalized Fractional Programming
From MaRDI portal
Publication:3148378
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
Cites work
- scientific article; zbMATH DE number 587626 (Why is no real title available?)
- scientific article; zbMATH DE number 3441151 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A note on an algorithm for generalized fractional programs
- An algorithm for generalized fractional programs
- Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
- Method of centers for generalized fractional programming
- Monotone Operators and the Proximal Point Algorithm
- On Nonlinear Fractional Programming
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Prox-regularization methods for generalized fractional programming
- Weak Sharp Minima in Mathematical 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
- Prox-regularization methods for generalized fractional programming
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Convergence of interval-type algorithms for generalized fractional programming
- A sixth bibliography of fractional programming
- Successive upper approximation methods for generalized fractional programs
- 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)
