On the public citation graph
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
0 signed · 202 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/bf00934130openalex-snapshot
Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00934765openalex-snapshot
On the convergence of a basic iterative method for the implicit complementarity problem
inferredcites →https://doi.org/10.1007/bf00939250openalex-snapshot
More results on the convergence of iterative methods for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01448356openalex-snapshot
Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
inferredcites →https://doi.org/10.1007/bf02591989openalex-snapshot
Inexact Newton methods for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf02591991openalex-snapshot
Error bounds for monotone linear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1016/0024-3795(73)90007-4openalex-snapshot
Bounds for error in the solution set of a perturbed linear program
inferredcites →https://doi.org/10.1016/0024-3795(89)90463-1openalex-snapshot
Sufficient matrices and the linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(90)90058-kopenalex-snapshot
Error bounds for the linear complementarity problem with a P-matrix
inferredcites →https://doi.org/10.1016/0377-2217(89)90500-6openalex-snapshot
Linear complementarity, linear and nonlinear programming
inferredcites →https://doi.org/10.1112/blms/13.4.381openalex-snapshot
VARIATIONAL INEQUALITIES AND COMPLEMENTARITY PROBLEMS
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1137/0329057openalex-snapshot
On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferredcites →https://doi.org/10.1137/0702022openalex-snapshot
On the Solution of Singular and Semidefinite Linear Systems by Iteration
inferredcites →https://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9780898719451openalex-snapshot
An Introduction to Variational Inequalities and Their Applications
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/moor.12.3.474openalex-snapshot
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.6028/jres.049.027openalex-snapshot
On approximate solutions of systems of linear inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1521-4001(200207)82:7<435::aid-zamm435>3.0.co;2-1openalex-snapshot
Existence and Continuity of Optimal Solutions to some Structural Topology Optimization Problems Including Unilateral Constraints and Stochastic Loads
inferred← citeshttps://doi.org/10.1002/mma.9156openalex-snapshot
Convergence of the projection and contraction methods for solving bilevel variational inequality problems
inferred← citeshttps://doi.org/10.1002/nla.2237openalex-snapshot
On greedy randomized coordinate descent methods for solving large linear least‐squares problems
inferred← citeshttps://doi.org/10.1002/zamm.200310029openalex-snapshot
Stochastic structural topology optimization: existence of solutions and sensitivity analyses
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_479openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_630openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_13openalex-snapshot
Parallel Solution of Large Scale Quadratic Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-5197-3_4openalex-snapshot
A Note on Error Bounds for Convex and Nonconvex Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_16openalex-snapshot
Error Bounds for Quadratic Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_14openalex-snapshot
A Class of Globally Convergent Algorithms for Pseudomonotone Variational Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4757-6388-1_13openalex-snapshot
Regularized Linear Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4757-6388-1_8openalex-snapshot
Merit Functions and Stability for Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf01096765openalex-snapshot
The linear complementarity problem as a separable bilinear program
inferred← citeshttps://doi.org/10.1007/bf01581148openalex-snapshot
New improved error bounds for the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01581264openalex-snapshot
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
inferred← citeshttps://doi.org/10.1007/bf01582210openalex-snapshot
Error bounds for analytic systems and their applications
inferred← citeshttps://doi.org/10.1007/bf01585171openalex-snapshot
Nonlinear complementarity as unconstrained and constrained minimization
inferred← citeshttps://doi.org/10.1007/bf01585182openalex-snapshot
On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP
inferred← citeshttps://doi.org/10.1007/bf02023101openalex-snapshot
Error bounds and strong upper semicontinuity for monotone affine variational inequalities
inferred← citeshttps://doi.org/10.1007/bf02096261openalex-snapshot
Error bounds and convergence analysis of feasible descent methods: a general approach
inferred← citeshttps://doi.org/10.1007/bf02192231openalex-snapshot
On the convergence of projection methods: Application to the decomposition of affine variational inequalities
inferred← citeshttps://doi.org/10.1007/bf02193464openalex-snapshot
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf02614384openalex-snapshot
On homogeneous and self-dual algorithms for LCP
inferred← citeshttps://doi.org/10.1007/bf02677381openalex-snapshot
A splitting method for quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s002110100362openalex-snapshot
New projection-type methods for monotone LCP with finite termination
inferred← citeshttps://doi.org/10.1007/s00245-025-10238-6openalex-snapshot
A Generalization of Hoffman’s Lemma in Banach Spaces and Applications
inferred← citeshttps://doi.org/10.1007/s002450010023openalex-snapshot
Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems
inferred← citeshttps://doi.org/10.1007/s10013-020-00467-3openalex-snapshot
Complementary Problems with Polynomial Data
inferred← citeshttps://doi.org/10.1007/s10107-002-0369-zopenalex-snapshot
Convergence rate analysis of iteractive algorithms for solving variational inequality problems
inferred← citeshttps://doi.org/10.1007/s10107-007-0170-0openalex-snapshot
A coordinate gradient descent method for nonsmooth separable minimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0426-yopenalex-snapshot
An LPCC approach to nonconvex quadratic programs
inferred← citeshttps://doi.org/10.1007/s10107-012-0599-7openalex-snapshot
A class of Dantzig–Wolfe type decomposition methods for variational inequality problems
inferred← citeshttps://doi.org/10.1007/s10107-015-0951-9openalex-snapshot
On conic QPCCs, conic QCQPs and completely positive programs
inferred← citeshttps://doi.org/10.1007/s10107-018-1280-6openalex-snapshot
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo–Tseng error bound property
inferred← citeshttps://doi.org/10.1007/s10107-018-1286-0openalex-snapshot
On the pervasiveness of difference-convexity in optimization and statistics
inferred← citeshttps://doi.org/10.1007/s10107-021-01756-6openalex-snapshot
Error bounds and a condition number for the absolute value equations
inferred← citeshttps://doi.org/10.1007/s10107-022-01860-1openalex-snapshot
Exact computation of an error bound for the balanced linear complementarity problem with unique solution
inferred← citeshttps://doi.org/10.1007/s10107-022-01916-2openalex-snapshot
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification
inferred← citeshttps://doi.org/10.1007/s101070050086openalex-snapshot
Inexact implicit methods for monotone general variational inequalities
inferred← citeshttps://doi.org/10.1007/s101070050101openalex-snapshot
Feasible descent algorithms for mixed complementarity problems
inferred← citeshttps://doi.org/10.1007/s10255-005-5197-5openalex-snapshot
Block monotone iterative algorithms for variational inequalities with nonlinear operators
inferred← citeshttps://doi.org/10.1007/s10589-008-9215-4openalex-snapshot
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
inferred← citeshttps://doi.org/10.1007/s10589-018-9981-6openalex-snapshot
On the convergence of the gradient projection method for convex optimal control problems with bang–bang solutions
inferred← citeshttps://doi.org/10.1007/s10589-022-00357-zopenalex-snapshot
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-022-00396-6openalex-snapshot
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
inferred← citeshttps://doi.org/10.1007/s10898-004-8276-xopenalex-snapshot
Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization
inferred← citeshttps://doi.org/10.1007/s10898-010-9644-3openalex-snapshot
On linear programs with linear complementarity constraints
inferred← citeshttps://doi.org/10.1007/s10898-016-0410-zopenalex-snapshot
Sufficient conditions for error bounds of difference functions and applications
inferred← citeshttps://doi.org/10.1007/s10898-017-0575-0openalex-snapshot
The Glowinski–Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces
inferred← citeshttps://doi.org/10.1007/s10898-022-01200-9openalex-snapshot
DC auxiliary principle methods for solving lexicographic equilibrium problems
inferred← citeshttps://doi.org/10.1007/s10898-023-01331-7openalex-snapshot
DC algorithms in Hilbert spaces and the solution of indefinite infinite-dimensional quadratic programs
inferred← citeshttps://doi.org/10.1007/s10898-025-01492-7openalex-snapshot
A dual adaptive algorithm for matrix optimization with sparse group lasso regularization
inferred← citeshttps://doi.org/10.1007/s10898-026-01602-zopenalex-snapshot
Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
inferred← citeshttps://doi.org/10.1007/s10915-026-03441-2openalex-snapshot
Alternating Iterative Methods for Solving the Inverse Eigenvalue Problems on the Manifold of Tensors with Fixed TT-Ranks
inferred← citeshttps://doi.org/10.1007/s10957-011-9903-6openalex-snapshot
Stability Analysis of One Stage Stochastic Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10957-017-1090-7openalex-snapshot
On the Range of the Pseudomonotone Second-Order Cone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10957-018-1296-3openalex-snapshot
Affine Variational Inequalities on Normed Spaces
inferred← citeshttps://doi.org/10.1007/s10957-018-1356-8openalex-snapshot
Error Bounds for the Solution Sets of Quadratic Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-020-01779-7openalex-snapshot
Kurdyka–Łojasiewicz Property of Zero-Norm Composite Functions
inferred← citeshttps://doi.org/10.1007/s10957-020-01782-yopenalex-snapshot
Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-021-01827-wopenalex-snapshot
On the Linear Convergence to Weak/Standard d-Stationary Points of DCA-Based Algorithms for Structured Nonsmooth DC Programming
inferred← citeshttps://doi.org/10.1007/s10957-021-01865-4openalex-snapshot
Level-Set Subdifferential Error Bounds and Linear Convergence of Bregman Proximal Gradient Method
inferred← citeshttps://doi.org/10.1007/s10957-023-02171-xopenalex-snapshot
Error Bound and Isocost Imply Linear Convergence of DCA-Based Algorithms to D-Stationarity
inferred← citeshttps://doi.org/10.1007/s10957-024-02525-zopenalex-snapshot
Convergence-Accelerated Fixed-Time Dynamical Methods for Absolute Value Equations
inferred← citeshttps://doi.org/10.1007/s10957-025-02769-3openalex-snapshot
Generalized Polyhedral DC Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11117-026-01174-yopenalex-snapshot
A note on the error bound at infinity for nonconvex inequality systems via asymptotic analysis
inferred← citeshttps://doi.org/10.1007/s11228-020-00570-0openalex-snapshot
Perturbation Techniques for Convergence Analysis of Proximal Gradient Method and Other First-Order Algorithms via Variational Analysis
inferred← citeshttps://doi.org/10.1007/s11228-022-00656-xopenalex-snapshot
The Boosted DC Algorithm for Linearly Constrained DC Programming
inferred← citeshttps://doi.org/10.1007/s11228-026-00790-wopenalex-snapshot
A Fully Relaxed Tseng’s Splitting Method
inferred← citeshttps://doi.org/10.1007/s11590-011-0292-4openalex-snapshot
SOR- and Jacobi-type iterative methods for solving ℓ 1 − ℓ 2 problems by way of Fenchel duality
inferred← citeshttps://doi.org/10.1007/s40305-014-0047-xopenalex-snapshot
On the Linear Convergence of the Approximate Proximal Splitting Method for Non-smooth Convex Optimization
inferred← citeshttps://doi.org/10.1007/s40305-019-00271-yopenalex-snapshot
Local Linear Convergence of an ADMM-Type Splitting Framework for Equality Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s40306-025-00592-6openalex-snapshot
Global Error Bounds for Nonmonotone Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90049-gopenalex-snapshot
Global error bounds for monotone affine variational inequality problems
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00707-5openalex-snapshot
On a global projection-type error bound for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90080-mopenalex-snapshot
On a global error bound for a class of monotone affine variational inequality problems
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90076-0openalex-snapshot
Error bounds for inconsistent linear inequalities and programs
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00019-gopenalex-snapshot
Condition numbers for polyhedra with real number data
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00093-gopenalex-snapshot
A parallel relaxation method for quadratic programming problems with interval constraints
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00094-hopenalex-snapshot
On linear convergence of iterative methods for the variational inequality problem
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00104-2openalex-snapshot
Error estimates and Lipschitz constants for best approximation in continuous function spaces
inferred← citeshttps://doi.org/10.1016/j.amc.2004.03.005openalex-snapshot
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
inferred← citeshttps://doi.org/10.1016/j.amc.2019.04.048openalex-snapshot
Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124788openalex-snapshot
A new error bound for linear complementarity problems with weakly chained diagonally dominant B-matrices
inferred← citeshttps://doi.org/10.1016/j.cam.2004.05.018openalex-snapshot
A matrix-splitting method for symmetric affine second-order cone complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2024.116288openalex-snapshot
Global error bound estimates algorithm for an R0 -type generalized LCP over polyhedral cone and its applications
inferred← citeshttps://doi.org/10.1016/j.conengprac.2026.106818openalex-snapshot
Experimental validation of parallel model predictive control on multiple low-resource IoT devices
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.02.007openalex-snapshot
Modified matrix splitting method for the support vector machine and its application to the credit classification of companies in Korea
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.02.011openalex-snapshot
On M-stationary points for mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1016/j.jmaa.2014.10.048openalex-snapshot
Linear convergence of a type of iterative sequences in nonconvex quadratic programming
inferred← citeshttps://doi.org/10.1016/j.na.2005.03.104openalex-snapshot
A new relative error criterion for the proximal point algorithm
inferred← citeshttps://doi.org/10.1016/j.orl.2017.06.006openalex-snapshot
Error bounds for affine variational inequalities with second-order cone constraints
inferred← citeshttps://doi.org/10.1016/s0096-3003(01)00030-3openalex-snapshot
Block monotone iterative methods for elliptic variational inequalities
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00327-7openalex-snapshot
Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00730-6openalex-snapshot
Some recent advances in projection-type methods for variational inequalities
inferred← citeshttps://doi.org/10.1016/s0377-0427(97)00025-3openalex-snapshot
Descent methods with linesearch in the presence of perturbations
inferred← citeshttps://doi.org/10.1017/s0004972710000389openalex-snapshot
A MULTIPLICATIVE SCHWARZ ALGORITHM FOR THE NONLINEAR COMPLEMENTARITY PROBLEM WITH ANM-FUNCTION
inferred← citeshttps://doi.org/10.1023/a:1008618009738openalex-snapshot
New Inexact Parallel Variable Distribution Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008652705980openalex-snapshot
On Extensions of the Frank-Wolfe Theorems
inferred← citeshttps://doi.org/10.1023/a:1008659512824openalex-snapshot
A Note on Error Bounds for Convex and Nonconvex Programs
inferred← citeshttps://doi.org/10.1023/a:1012606212823openalex-snapshot
Unified Framework of Extragradient-Type Methods for Pseudomonotone Variational Inequalities
inferred← citeshttps://doi.org/10.1023/a:1018905724427openalex-snapshot
On quadratic convergence of the $$O\left( {\sqrt {nL} } \right)$$ -iteration homogeneous and self‐duallinear programming algorithm
inferred← citeshttps://doi.org/10.1023/a:1022602123316openalex-snapshot
Convergence Analysis of Perturbed Feasible Descent Methods
inferred← citeshttps://doi.org/10.1023/a:1026434200384openalex-snapshot
Error Bounds for R0-Type and Monotone Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1023/a:1026598214921openalex-snapshot
Merit Functions for Complementarity and Related Problems: A Survey
inferred← citeshttps://doi.org/10.1080/00036811.2022.2054417openalex-snapshot
Robust error bounds for uncertain convex inequality systems with applications
inferred← citeshttps://doi.org/10.1080/00207169708804568openalex-snapshot
Splitting methods for quadratic optimization in data analysis
inferred← citeshttps://doi.org/10.1080/01630563.2023.2297426openalex-snapshot
Local Error Bounds for Affine Variational Inequalities on Hilbert Spaces
inferred← citeshttps://doi.org/10.1080/02331934.2022.2141056openalex-snapshot
On a solution method in indefinite quadratic programming under linear constraints
inferred← citeshttps://doi.org/10.1080/02331934.2025.2547718openalex-snapshot
New sufficient and necessary conditions for constrained and unconstrained Lipschitzian error bounds
inferred← citeshttps://doi.org/10.1080/03081087.2020.1860885openalex-snapshot
Error bounds for the solution sets of generalized polynomial complementarity problems
inferred← citeshttps://doi.org/10.1080/10556780310001634073openalex-snapshot
Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1080/10556788.2023.2278092openalex-snapshot
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems
inferred← citeshttps://doi.org/10.1080/10556789508805627openalex-snapshot
On the local superlinear convergence of a Newton-type method for LCP under weak conditions
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028464openalex-snapshot
Dimensionality reduction of affine variational inequalities using random projections
inferred← citeshttps://doi.org/10.1109/ascc.2017.8287530openalex-snapshot
On the use of intermediate solutions in parallel model predictive control based on matrix splitting
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798614openalex-snapshot
Parallel model predictive control for input constrained linear systems
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9993341openalex-snapshot
Faster Asynchronous Nonconvex Block Coordinate Descent with Locally Chosen Stepsizes
inferred← citeshttps://doi.org/10.1109/tac.2026.3654317openalex-snapshot
Distributed Asynchronous Time-Varying Quadratic Programming With Asynchronous Objective Sampling
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3115698openalex-snapshot
Faster Convergence in Deep-Predictive-Coding Networks to Learn Deeper Representations
inferred← citeshttps://doi.org/10.1137/0801036openalex-snapshot
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
inferred← citeshttps://doi.org/10.1137/0803003openalex-snapshot
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
inferred← citeshttps://doi.org/10.1137/0803008openalex-snapshot
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0803022openalex-snapshot
A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
inferred← citeshttps://doi.org/10.1137/0804021openalex-snapshot
Extension of Hoffman’s Error Bound to Polynomial Systems
inferred← citeshttps://doi.org/10.1137/1.9781611978995openalex-snapshot
Introduction to Nonsmooth Analysis and Optimization
inferred← citeshttps://doi.org/10.1137/120886753openalex-snapshot
Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
inferred← citeshttps://doi.org/10.1137/140971178openalex-snapshot
On the Global Linear Convergence of the ADMM with MultiBlock Variables
inferred← citeshttps://doi.org/10.1137/140974237openalex-snapshot
Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
inferred← citeshttps://doi.org/10.1137/s036301299222888xopenalex-snapshot
On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
inferred← citeshttps://doi.org/10.1137/s0363012993243022openalex-snapshot
Error Bounds for Piecewise Convex Quadratic Programs and Applications
inferred← citeshttps://doi.org/10.1137/s0363012994261690openalex-snapshot
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012994268655openalex-snapshot
Modified Projection-Type Methods for Monotone Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012995292664openalex-snapshot
A New Algorithm for State-Constrained Separated Continuous Linear Programs
inferred← citeshttps://doi.org/10.1137/s0895479893262734openalex-snapshot
The Extended Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/s1052623493246045openalex-snapshot
A New Algorithm for Solving Strictly Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1137/s1052623495287927openalex-snapshot
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623495290179openalex-snapshot
Convergence Rates in Forward--Backward Splitting
inferred← citeshttps://doi.org/10.1137/s1052623495293949openalex-snapshot
On the Convergence of Constrained Parallel Variable Distribution Algorithms
inferred← citeshttps://doi.org/10.1137/s1052623498339739openalex-snapshot
On the Identification of Zero Variables in an Interior-Point Framework
inferred← citeshttps://doi.org/10.1137/s1052623499363232openalex-snapshot
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
inferred← citeshttps://doi.org/10.1142/s0217595920500359openalex-snapshot
On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming
inferred← citeshttps://doi.org/10.1287/moor.1060.0193openalex-snapshot
A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization
inferred← citeshttps://doi.org/10.1287/moor.1080.0345openalex-snapshot
A Conic Duality Frank–Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization
inferred← citeshttps://doi.org/10.1287/moor.1100.0456openalex-snapshot
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
inferred← citeshttps://doi.org/10.1287/moor.19.3.645openalex-snapshot
Parallel Constraint Distribution in Convex Quadratic Programming
inferred← citeshttps://doi.org/10.1287/moor.19.4.880openalex-snapshot
New Error Bounds for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1287/moor.2021.1243openalex-snapshot
Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
inferred← citeshttps://doi.org/10.1287/moor.22.2.326openalex-snapshot
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
inferred← citeshttps://doi.org/10.1287/moor.23.2.443openalex-snapshot
Global Error Bounds for Convex Multifunctions and Applications
inferred← citeshttps://doi.org/10.1515/math-2019-0127openalex-snapshot
New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
inferred← citeshttps://doi.org/10.15807/jorsj.39.407openalex-snapshot
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
inferred← citeshttps://doi.org/10.23919/iccas.2017.8204425openalex-snapshot
Primal formulation of parallel model predictive control
inferred← citeshttps://doi.org/10.3390/math9121373openalex-snapshot
Error Estimations for Total Variation Type Regularization
inferred← citeshttps://doi.org/10.3934/jimo.2020053openalex-snapshot
The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
inferred← citeshttps://doi.org/10.3934/math.2021630openalex-snapshot
CKV-type $ B $-matrices and error bounds for linear complementarity problems
inferred← citeshttps://doi.org/10.3934/math.2022179openalex-snapshot
New error bound for linear complementarity problem of $ S $-$ SDDS $-$ B $ matrices
inferred← citeshttps://doi.org/10.3934/naco.2013.3.627openalex-snapshot
Error bounds for symmetric cone complementarity problems
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5350openalex-snapshot
On the Linear Convergence of the Approximate Proximal Splitting Method for Non-Smooth Convex Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06958openalex-snapshot
Isotone projection cones and Q-matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03535openalex-snapshot
On the Pervasiveness of Difference-Convexity in Optimization and Statistics
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06938openalex-snapshot
A stroll in the jungle of error bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1803.00190openalex-snapshot
On the Finite Number of Directional Stationary Values of Piecewise Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02044openalex-snapshot
Convergence of a Solution Algorithm in Indefinite Quadratic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1905.08445openalex-snapshot
A Variational Approach on Level sets and Linear Convergence of Variable Bregman Proximal Gradient Method for Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10926openalex-snapshot
Linear Convergence of Variable Bregman Stochastic Coordinate Descent Method for Nonsmooth Nonconvex Optimization by Level-set Variational Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2008.13627openalex-snapshot
Level-set Subdifferential Error Bounds and Linear Convergence of Variable Bregman Proximal Gradient Method
inferred← citeshttps://doi.org/10.68381/jca28017openalex-snapshot
Preconditioned Proximal Point Methods and Notions of Partial Subregularity
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.