A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
From MaRDI portal
Publication:2667040
Recommendations
- First-order algorithms for a class of fractional optimization problems
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Proximal-gradient algorithms for fractional programming
- scientific article; zbMATH DE number 7753349
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A Scale-Invariant Approach for Sparse Signal Recovery
- Adaptive restart for accelerated gradient schemes
- Compressed sensing
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and monotone operator theory in Hilbert spaces
- DC formulations and algorithms for sparse optimization problems
- First-order methods in optimization
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Minimization of \(\ell_{1-2}\) for compressed sensing
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- 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
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable restoration and separation of approximately sparse signals
- Stable signal recovery from incomplete and inaccurate measurements
- Structured sparsity promoting functions
- Variational Analysis
Cited in
(14)- First-order algorithms for a class of fractional optimization problems
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- Sparse recovery: the square of _1/_2 norms
- Block coordinate Dinkelbach algorithms for solving block-structured constrained fractional optimization problems
- Full splitting algorithms for fractional programs with structured numerators and denominators
- An implementable proximal extragradient method for structured fractional programming
- A single-loop proximal subgradient algorithm for A class structured fractional programs
- Minimizing quotient regularization model
- Recovery analysis for the _p/_1 minimization problem
- Robust penalized Dantzig selector: error analysis, oracle inequalities, and algorithmic efficiency
- An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
- Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
This page was built for publication: A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667040)
