Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
From MaRDI portal
Publication:3066922
DOI10.1080/02331930903395857zbMath1208.65080MaRDI QIDQ3066922
No author found.
Publication date: 20 January 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903395857
proximal methods; Bregman functions; generalized fractional programming; B-functions; Dinkelbach-type algorithms
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
90C32: Fractional programming
Related Items
A proximal point algorithm for generalized fractional programs, Convergence of a proximal algorithm for solving the dual of a generalized fractional program, Dual method of centers for solving generalized fractional programs, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Prox-dual regularization algorithm for generalized fractional programs
Cites Work
- Unnamed Item
- 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
- Penalty-proximal methods in convex programming
- Well behaved asymptotical convex functions
- Finite termination of the proximal point algorithm
- Algorithms for generalized fractional programming
- Proximal minimization algorithm with \(D\)-functions
- Convergence of some algorithms for convex minimization
- Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
- The deconvolution operation in convex analysis: an introduction
- Family of perturbation methods for variational inequalities
- Prox-regularization methods for generalized fractional programming
- Weak Sharp Minima in Mathematical Programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On Nonlinear Fractional Programming
