Conditional gradient method for double-convex fractional programming matrix problems

DOI10.1007/s10957-017-1203-3zbMath1453.65130OpenAlexW2773507135MaRDI QIDQ1706413

Rentsen Enkhbat, Mohammed Bellalij, Abderrahman Bouhamidi, Marcos Raydan, Khalide Jbilou

Publication date: 22 March 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1203-3

zbMATH Keywords

fractional programmingconditional gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32)

Related Items

An accelerated tensorial double proximal gradient method for total variation regularization problem, Tensorial conditional gradient method for solving multidimensional ill-posed problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional gradient algorithms for norm-regularized smooth convex optimization
• Fractional programming: Applications and algorithms
• Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
• Global optimization of fractional programs
• Handbook of global optimization
• Discrete and fractional programming techniques for location models
• Conditional gradient Tikhonov method for a convex optimization problem in image restoration
• A global optimization approach to fractional optimal control
• The Trace Ratio Optimization Problem
• Iterative minimization of the Rayleigh quotient by block steepest descent iterations
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
• Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature
• Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations
• On Nonlinear Fractional Programming
• Fractional programming
• Optimality conditions and duality for a class of nonlinear fractional programming problems.