Fixed point quasiconvex subgradient method
From MaRDI portal
Publication:2282530
DOI10.1016/j.ejor.2019.09.037zbMath1430.90470arXiv1811.06708OpenAlexW2976503777MaRDI QIDQ2282530
Kazuhiro Hishinuma, Hideaki Iiduka
Publication date: 8 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06708
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Fractional programming (90C32)
Related Items (4)
Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem ⋮ Semistrictly and neatly quasiconvex programming using lower global subdifferentials ⋮ Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Lower subdifferentiable functions and their minimization by cutting planes
- Conditional subgradient optimization -- theory and applications
- Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization
- A more efficient algorithm for convex nonparametric least squares
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Algorithms for the quasiconvex feasibility problem
- Inexact subgradient methods for quasi-convex optimization problems
- Hard-constrained inconsistent signal feasibility problems
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
- Fractional Programming with Homogeneous Functions
- On Convergence Properties of a Subgradient Method
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence and efficiency of subgradient methods for quasiconvex minimization
This page was built for publication: Fixed point quasiconvex subgradient method
