Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
From MaRDI portal
Publication:6133341
DOI10.1080/01630563.2023.2217893zbMath1522.90212OpenAlexW4379514925MaRDI QIDQ6133341
No author found.
Publication date: 24 July 2023
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2023.2217893
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear and semilinear partial differential equations. An introduction
- Nash-type equilibria and periodic solutions to nonvariational systems
- Handbook of generalized convexity and generalized monotonicity
- Generalized convexity and optimization. Theory and applications
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Algorithms for generalized fractional programming
- Generalized concavity
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- On some generalizations of Ekeland's principle and inward contractions in gauge spaces
- On the variational principle
- Fractional programming: The sum-of-ratios case
- Bibliography in fractional programming
- Proximal-gradient algorithms for fractional programming
- On Nonlinear Fractional Programming
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- A combined algorithm for fractional programming
This page was built for publication: Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems