Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints

Cites work

A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
A note: An improved upper bound for the online inventory problem with bounded storage and order costs
A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
A Scale-Invariant Approach for Sparse Signal Recovery
A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
An algorithm for generalized fractional programs
An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
Bibliography: Ninth bibliography of fractional programming
Computational method for solving a stochastic linear-quadratic control problem given an unsolvable stochastic algebraic Riccati equation
Convex analysis and monotone operator theory in Hilbert spaces
Distributed optimization and statistical learning via the alternating direction method of multipliers
Equivalence of various linearization algorithms for linear fractional programming
Extended omega ratio optimization for risk-averse investors
Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
First-order algorithms for a class of fractional optimization problems
First-order methods in optimization
Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
Fixed point quasiconvex subgradient method
Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
Fractional Programming with Homogeneous Functions
Fractional Programming. II, On Dinkelbach's Algorithm
Fractional programming: Applications and algorithms
Generalized convexity and optimization. Theory and applications
Globally Optimal Energy-Efficient Power Control and Receiver Design in Wireless Networks
scientific article; zbMATH DE number 6511278 (Why is no real title available?)
scientific article; zbMATH DE number 1095224 (Why is no real title available?)
Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
Incremental subgradient methods for nondifferentiable optimization
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
Inexact subgradient methods for quasi-convex optimization problems
Iterative methods for fixed point problems in Hilbert spaces
Linear and strong convergence of algorithms involving averaged nonexpansive operators
Linear convergence rates for extrapolated fixed point algorithms
Mixed max-and-min fractional programming for wireless networks
On Nonlinear Fractional Programming
On Projection Algorithms for Solving Convex Feasibility Problems
On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
On strongly quasiconvex functions: existence results and proximal point algorithms
Optimal trade-off portfolio selection between total risk and maximum relative marginal risk^†
Parametric approaches to fractional programs
Programming with linear fractional functionals
Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
Proximal-gradient algorithms for fractional programming
Pseudo-Concave Programming and Lagrange Regularity
Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
Two stochastic optimization algorithms for convex optimization with fixed point constraints

This page was built for publication: Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints

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