A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems

DOI10.1016/J.APNUM.2024.05.006MaRDI QIDQ6577595zbMATH OpenFDO

Authors X. J. Long, Xiaoting Wang, Gaoxi Li, Geng-Hua Li

Publication date 24 July 2024

Published in Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

fractional optimization problemKurdyka-Łojasiewicz propertyBregman proximal subgradient algorithmrelative smoothrelative weakly convex

Mathematics Subject Classification ID

Fractional programming (90C32) Nonconvex programming, global optimization (90C26)

Recommendations

• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
• First-order algorithms for a class of fractional optimization problems
• Proximal-gradient algorithms for fractional programming
• A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity

Cites work

• scientific article; zbMATH DE number 3848997 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• A Scale-Invariant Approach for Sparse Signal Recovery
• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
• A simplified view of first order methods for optimization
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
• An algorithm for generalized fractional programs
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• First-order algorithms for a class of fractional optimization problems
• Fractional Programming. II, On Dinkelbach's Algorithm
• Image deblurring with Poisson data: from cells to galaxies
• Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
• On Nonlinear Fractional Programming
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Optical Wavefront Reconstruction: Theory and Numerical Methods
• Parametric approaches to fractional programs
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal-gradient algorithms for fractional programming
• Relatively smooth convex optimization by first-order methods, and applications
• Sparse Generalized Eigenvalue Problem: Optimal Statistical Rates via Truncated Rayleigh Flow
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• The equivalence of three types of error bounds for weakly and approximately convex functions
• Variational Analysis
• When all risk-adjusted performance measures are the same: in praise of the Sharpe ratio

This page was built for publication: A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577595)