Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A projection algorithm for non-convex split feasibility problem

From MaRDI portal
Publication:6550982
Jump to:navigation, search

zbMATH Open1539.90082MaRDI QIDQ6550982FDOQ6550982


Authors: Yang Yang, Biao Qu, Ming Qiu Edit this on Wikidata


Publication date: 5 June 2024

Published in: Pacific Journal of Optimization (Search for Journal in Brave)





Recommendations

  • Inexact averaged projection algorithm for nonconvex multiple-set split feasibility problems
  • Non-convex split Feasibility problems: models, algorithms and theory
  • S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems
  • A semi-alternating algorithm for solving nonconvex split equality problems
  • An inertial proximal splitting method with applications


zbMATH Keywords

convergenceKurdyka-Lojasiewicz propertyprojection gradient algorithmnon-convex split feasibility problem


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)



Cited In (1)

  • S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems





This page was built for publication: A projection algorithm for non-convex split feasibility problem

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6550982&oldid=40077956"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 16:37. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki