Yazheng Dang

From MaRDI portal
Person:1751067

Available identifiers

zbMath Open dang.yazhengMaRDI QIDQ1751067

List of research outcomes





PublicationDate of PublicationType
Multi-block relaxed-dual linear inertial ADMM algorithm for nonconvex and nonsmooth problems with nonseparable structures2025-01-10Paper
Two inertial proximal coordinate algorithms for a family of nonsmooth and nonconvex optimization problems2025-01-08Paper
Sequential inertial linear ADMM algorithm for nonconvex and nonsmooth multiblock problems with nonseparable structure2024-09-24Paper
An inertial triple-projection algorithm for solving the split feasibility problem2022-11-14Paper
https://portal.mardi4nfdi.de/entity/Q50135422021-11-30Paper
An inertial iterative algorithm with strong convergence for solving modified split feasibility problem in Banach spaces2021-06-28Paper
https://portal.mardi4nfdi.de/entity/Q51435962021-01-14Paper
Fast self-adaptive regularization iterative algorithm for solving split feasibility problem2020-06-18Paper
Double projection algorithms for solving the split feasibility problems2019-07-25Paper
A new extragradient-type algorithm for the split feasibility problem2018-10-12Paper
Relaxed two points projection method for solving the multiple-sets split equality problem2018-05-23Paper
Inertial accelerated algorithms for solving a split feasibility problem2017-05-22Paper
Non-monotonous sequential subgradient projection algorithm for convex feasibility problem2017-04-04Paper
An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings2017-01-17Paper
Convergence analysis of a parallel projection algorithm for solving convex feasibility problems2017-01-09Paper
Hybrid CQ projection algorithm with line-search process for the split feasibility problem2016-04-11Paper
https://portal.mardi4nfdi.de/entity/Q34611052016-01-15Paper
https://portal.mardi4nfdi.de/entity/Q31958652015-10-28Paper
Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem2015-06-29Paper
Iterative process for solving a multiple-set split feasibility problem2015-03-13Paper
Weak and strong convergence of an algorithm for the split common fixed-point of asymptotically quasi-nonexpansive operators2014-11-24Paper
Convergence of an algorithm for the split common fixed-point of asymptomatic quasi-nonexpansive operators2014-11-07Paper
An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem2014-11-03Paper
A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.2014-09-19Paper
Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem2014-07-10Paper
Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators2014-06-23Paper
https://portal.mardi4nfdi.de/entity/Q53993782014-02-28Paper
The strong convergence of a three-step algorithm for the split feasibility problem2013-08-27Paper
A perturbed projection algorithm with inertial technique for split feasibility problem2012-08-06Paper
An extrapolated iterative algorithm for multiple-set split feasibility problem2012-07-18Paper
A strongly convergent algorithm for the convex feasibility problem2012-06-01Paper
A strongly convergent parallel projection algorithm for convex feasibility problem2012-03-29Paper
Block-iterative subgradient projection algorithms for the convex feasibility problem2012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31095892012-01-27Paper
The strong convergence of a KM-CQ-like algorithm for a split feasibility problem2011-02-10Paper
Generalized gradient projection interior point algorithm for geometric programming2010-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36316252009-06-10Paper

Research outcomes over time

This page was built for person: Yazheng Dang