Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
From MaRDI portal
Publication:6155872
DOI10.1137/22M1472000zbMath1519.90182arXiv2011.09782MaRDI QIDQ6155872
Guoyin Li, Minh N. Dao, Radu Ioan Boţ
Publication date: 7 June 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.09782
linear convergencesparsitysum-of-ratiosKurdyka-Łojasiewicz propertyfractional programproximal block coordinate method
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Decomposition methods (49M27)
Related Items (4)
A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems ⋮ On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization ⋮ Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions ⋮ Multi-block relaxed-dual linear inertial ADMM algorithm for nonconvex and nonsmooth problems with nonseparable structures
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse Generalized Eigenvalue Problem: Optimal Statistical Rates via Truncated Rayleigh Flow
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Restricted normal cones and sparsity optimization with affine constraints
- On the global optimization of sums of linear fractional functions over a convex set
- An algorithm for generalized fractional programs
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- On Fréchet subdifferentials
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Generalized subdifferentials of the rank function
- Kurdyka-Łojasiewicz exponent via inf-projection
- Efficiency of minimizing compositions of convex functions and smooth maps
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Alternative branching rules for some nonconvex problems
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Variational Analysis
- Sparse Generalized Eigenvalue Problem Via Smooth Optimization
- Proximal Mapping for Symmetric Penalty and Sparsity
- Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
- Parametric approaches to fractional programs
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- Proximal-gradient algorithms for fractional programming
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
- On Nonlinear Fractional Programming
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
This page was built for publication: Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
