Pages that link to "Item:Q4018384"
From MaRDI portal
The following pages link to Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem (Q4018384):
Displayed 50 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Stability analysis of one stage stochastic mathematical programs with complementarity constraints (Q415375) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- On a global projection-type error bound for the linear complementarity problem (Q677141) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
- Sufficient conditions for error bounds of difference functions and applications (Q727390) (← links)
- Block monotone iterative algorithms for variational inequalities with nonlinear operators (Q942876) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Global error bounds for monotone affine variational inequality problems (Q1195343) (← links)
- On a global error bound for a class of monotone affine variational inequality problems (Q1197896) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities (Q1312768) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
- New improved error bounds for the linear complementarity problem (Q1340062) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Descent methods with linesearch in the presence of perturbations (Q1360171) (← links)
- On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Convergence analysis of perturbed feasible descent methods (Q1379956) (← links)
- Error bounds for the solution sets of quadratic complementarity problems (Q1626539) (← links)
- Affine variational inequalities on normed spaces (Q1670007) (← links)
- The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces (Q1702875) (← links)
- Error bounds for affine variational inequalities with second-order cone constraints (Q1728307) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions (Q1753075) (← links)
- A matrix-splitting method for symmetric affine second-order cone complementarity problems (Q1765477) (← links)
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results (Q1803603) (← links)
- The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
- Block monotone iterative methods for elliptic variational inequalities. (Q1855664) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities (Q1897456) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- On linear convergence of iterative methods for the variational inequality problem (Q1900764) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← links)
- The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems (Q1983743) (← links)
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
- Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method (Q2046546) (← links)
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)