On the public citation graph
On the convergence of Han's method for convex programming with quadratic objective
0 signed · 83 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800040113openalex-snapshot
A quadratic programming procedure
inferredcites →https://doi.org/10.1007/bf01389537openalex-snapshot
Convergence results for an accelerated nonlinear cimmino algorithm
inferredcites →https://doi.org/10.1007/bf02017349openalex-snapshot
Relaxed outer projections, weighted averages and convex feasibility
inferredcites →https://doi.org/10.1007/bf02612715openalex-snapshot
Decomposition through formalization in a product space
inferredcites →https://doi.org/10.1016/0024-3795(85)90280-0openalex-snapshot
A simultaneous projections method for linear inequalities
inferredcites →https://doi.org/10.1016/0041-5553(67)90113-9openalex-snapshot
The method of projections for finding the common point of convex sets
inferredcites →https://doi.org/10.1016/s0168-2024(08)70034-1openalex-snapshot
Chapter IX Applications of the Method of Multipliers to Variational Inequalities
inferredcites →https://doi.org/10.1090/s0002-9939-1959-0105008-8openalex-snapshot
Proximity Maps for Convex Sets
inferredcites →https://doi.org/10.1137/0318033openalex-snapshot
Extensions of Hildreth’s Row-Action Method for Quadratic Programming
inferredcites →https://doi.org/10.1137/0325014openalex-snapshot
A Simultaneous Iterative Method for Computing Projections on Polyhedra
inferredcites →https://doi.org/10.1137/0326019openalex-snapshot
A Parallel Algorithm for a Class of Convex Programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jath.1994.1136openalex-snapshot
Dykstra′s Alternating Projection Algorithm for Two Sets
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_143openalex-snapshot
Dykstra’s Algorithm and Robust Stopping Criteria
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_143-1openalex-snapshot
Dykstra’s Algorithm and Robust Stopping Criteria
inferred← citeshttps://doi.org/10.1007/bf01582566openalex-snapshot
A proximal-based decomposition method for convex minimization problems
inferred← citeshttps://doi.org/10.1007/bf01582569openalex-snapshot
A row-action method for convex programming
inferred← citeshttps://doi.org/10.1007/bf02142692openalex-snapshot
A multiprojection algorithm using Bregman projections in a product space
inferred← citeshttps://doi.org/10.1007/bf02187643openalex-snapshot
A parallel inexact newton method for stochastic programs with recourse
inferred← citeshttps://doi.org/10.1007/bf02193462openalex-snapshot
Primal-dual row-action method for convex programming
inferred← citeshttps://doi.org/10.1007/bf02614621openalex-snapshot
Two generalizations of Dykstra’s cyclic projections algorithm
inferred← citeshttps://doi.org/10.1007/bf02669680openalex-snapshot
A decomposition method for convex minimization problems and its application
inferred← citeshttps://doi.org/10.1007/bf02836811openalex-snapshot
Finding projections onto the intersection of convex sets in Hilbert spaces. II
inferred← citeshttps://doi.org/10.1007/s10589-007-9073-5openalex-snapshot
How good are projection methods for convex feasibility problems?
inferred← citeshttps://doi.org/10.1007/s10898-010-9617-6openalex-snapshot
The general iterative methods for nonexpansive mappings in Banach spaces
inferred← citeshttps://doi.org/10.1007/s10957-019-01512-zopenalex-snapshot
Dykstra’s Splitting and an Approximate Proximal Point Algorithm for Minimizing the Sum of Convex Functions
inferred← citeshttps://doi.org/10.1007/s11075-016-0121-zopenalex-snapshot
Iterative algorithms for solving variational inequalities and fixed point problems for asymptotically nonexpansive mappings in Banach spaces
inferred← citeshttps://doi.org/10.1007/springerreference_72221openalex-snapshot
Dykstra's Algorithm and Robust Stopping Criteria
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00089-iopenalex-snapshot
Block-iterative surrogate projection methods for convex feasibility problems
inferred← citeshttps://doi.org/10.1016/j.amc.2006.10.039openalex-snapshot
An iterative algorithm for approximating convex minimization problem
inferred← citeshttps://doi.org/10.1016/j.amc.2007.11.004openalex-snapshot
Strong convergence of a general iterative method for variational inequality problems and fixed point problems in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/j.amc.2008.11.038openalex-snapshot
Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings
inferred← citeshttps://doi.org/10.1016/j.aml.2010.02.010openalex-snapshot
Equivalent theorems of the convergence between Ishikawa–Halpern iteration and viscosity approximation method
inferred← citeshttps://doi.org/10.1016/j.cam.2008.10.058openalex-snapshot
Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.03.035openalex-snapshot
Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.01.025openalex-snapshot
Strong convergence of the modified Ishikawa iterative method for infinitely many nonexpansive mappings in Banach spaces
inferred← citeshttps://doi.org/10.1016/j.jat.2003.08.004openalex-snapshot
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces
inferred← citeshttps://doi.org/10.1016/j.laa.2005.10.006openalex-snapshot
Computational acceleration of projection algorithms for the linear best approximation problem
inferred← citeshttps://doi.org/10.1016/j.mcm.2007.12.008openalex-snapshot
Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems
inferred← citeshttps://doi.org/10.1016/j.mcm.2012.09.023openalex-snapshot
A viscosity scheme for mixed equilibrium problems, variational inequality problems and fixed point problems
inferred← citeshttps://doi.org/10.1016/j.na.2006.03.047openalex-snapshot
A general iterative method for a finite family of nonexpansive mappings
inferred← citeshttps://doi.org/10.1016/j.na.2007.07.013openalex-snapshot
A general iterative method for an infinite family of nonexpansive mappings
inferred← citeshttps://doi.org/10.1016/j.na.2008.09.009openalex-snapshot
Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings
inferred← citeshttps://doi.org/10.1016/s0165-1684(03)00002-1openalex-snapshot
Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80012-4openalex-snapshot
From Parallel to Sequential Projection Methods and Vice Versa in Convex Feasibility: Results and Conjectures
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80028-8openalex-snapshot
The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1080/00036810802308841openalex-snapshot
Some results on non-expansive mappings and relaxed cocoercive mappings in Hilbert spaces
inferred← citeshttps://doi.org/10.1080/01630569408816580openalex-snapshot
The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
inferred← citeshttps://doi.org/10.1080/01630569508816636openalex-snapshot
Finding projections onto the intersection of convex sets in hilbert spaces
inferred← citeshttps://doi.org/10.1080/01630569608816681openalex-snapshot
Cyclic projection methods on a class of nonconvex sets
inferred← citeshttps://doi.org/10.1080/01630569808816813openalex-snapshot
Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
inferred← citeshttps://doi.org/10.1080/01630569808816822openalex-snapshot
Quadratic optimization of fixed points of nonexpansive mappings in hubert space
inferred← citeshttps://doi.org/10.1080/02331930008844513openalex-snapshot
Dykstras algorithm with bregman projections: A convergence proof
inferred← citeshttps://doi.org/10.1080/10556780008805789openalex-snapshot
Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
inferred← citeshttps://doi.org/10.1109/5.214546openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/83.217232openalex-snapshot
Signal recovery by best feasible approximation
inferred← citeshttps://doi.org/10.1109/ita.2018.8503161openalex-snapshot
Distributed Algorithms: Tsitsiklis and Beyond
inferred← citeshttps://doi.org/10.1109/tsp.2003.812846openalex-snapshot
A block-iterative surrogate constraint splitting method for quadratic signal recovery
inferred← citeshttps://doi.org/10.1137/03060062xopenalex-snapshot
Robust Stopping Criteria for Dykstra's Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611976229.5openalex-snapshot
A Parallel Projection Method for Metric Constrained Optimization
inferred← citeshttps://doi.org/10.1137/15m1034830openalex-snapshot
A Distributed Boyle--Dykstra--Han Scheme
inferred← citeshttps://doi.org/10.1137/16m106090xopenalex-snapshot
The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
inferred← citeshttps://doi.org/10.1137/17m1128460openalex-snapshot
Distributed Stochastic Approximation with Local Projections
inferred← citeshttps://doi.org/10.1137/18m1217152openalex-snapshot
Metric-Constrained Optimization for Graph Clustering Algorithms
inferred← citeshttps://doi.org/10.1137/s0363012994261483openalex-snapshot
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
inferred← citeshttps://doi.org/10.1137/s0895479894277545openalex-snapshot
A Constrained Procrustes Problem
inferred← citeshttps://doi.org/10.1155/2008/454181openalex-snapshot
Strong Convergence of a Modified Iterative Algorithm for Mixed-Equilibrium Problems in Hilbert Spaces
inferred← citeshttps://doi.org/10.1155/2009/369215openalex-snapshot
A General Iterative Method for Solving the Variational Inequality Problem and Fixed Point Problem of an Infinite Family of Nonexpansive Mappings in Hilbert Spaces
inferred← citeshttps://doi.org/10.1155/2011/671754openalex-snapshot
New Iterative Approximation Methods for a Countable Family of Nonexpansive Mappings in Banach Spaces
inferred← citeshttps://doi.org/10.1155/2014/287602openalex-snapshot
Two-Step Viscosity Approximation Scheme for Variational Inequality in Banach Spaces
inferred← citeshttps://doi.org/10.1155/s1687182004309046openalex-snapshot
Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space
inferred← citeshttps://doi.org/10.1186/1687-1812-2012-117openalex-snapshot
Strong and weak convergence theorems for an infinite family of nonexpansive mappings and applications
inferred← citeshttps://doi.org/10.1186/1687-1812-2013-201openalex-snapshot
Strong convergence of a self-adaptive method for the split feasibility problem
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1075openalex-snapshot
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
inferred← citeshttps://doi.org/10.22436/jnsa.009.05.71openalex-snapshot
On common solutions gradient algorithms, strong convergence theorems and their applications
inferred← citeshttps://doi.org/10.3390/mca25030054openalex-snapshot
Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces
inferred← citeshttps://doi.org/10.36227/techrxiv.18526274openalex-snapshot
Improved Prediction Dynamics for Robust MPC
inferred← citeshttps://doi.org/10.36227/techrxiv.18526274.v1openalex-snapshot
Improved Prediction Dynamics for Robust MPC
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01678openalex-snapshot
A Projection Method for Metric-Constrained Optimization
inferred← citeshttps://doi.org/10.53846/goediss-2591openalex-snapshot
Statistische Multiresolutions-Schätzer in linearen inversen Problemen - Grundlagen und algorithmische Aspekte
inferred← citeshttps://doi.org/10.68381/jca06018openalex-snapshot
Dykstra's Algorithm as the Nonlinear Extension of Bregman's Optimization Method
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.