Augmented Lagrange primal-dual approach for generalized fractional programming problems
From MaRDI portal
Recommendations
- Using duality to solve generalized fractional programming problems
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- A new algorithm for generalized fractional programs
- Prox-dual regularization algorithm for generalized fractional programs
- A primal-dual augmented Lagrangian
Cited in
(8)- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Dual method of centers for solving generalized fractional programs
- Prox-dual regularization algorithm for generalized fractional programs
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- 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
- Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved
This page was built for publication: Augmented Lagrange primal-dual approach for generalized fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q380509)