Method of alternating projections for the general absolute value equation
From MaRDI portal
(Redirected from Publication:2111941)
Recommendations
- Global and finite convergence of a generalized Newton method for absolute value equations
- Residual iterative method for solving absolute value equations
- Modified HS conjugate gradient method for solving generalized absolute value equations
- A modified generalized Newton method for absolute value equations
- The proximal methods for solving absolute value equation
Cites work
- A generalization of the Gauss-Seidel iteration method for solving absolute value equations
- A generalized Newton method for absolute value equations
- A globally and quadratically convergent method for absolute value equations
- A hybrid algorithm for solving the absolute value equation
- A note on absolute value equations
- A note on unique solvability of the absolute value equation
- A theorem of the alternatives for the equationAx+B|x| =b
- Absolute value equation solution via concave minimization
- Absolute value equations
- Absolute value programming
- Algorithms based on unions of nonexpansive maps
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Complementary pivot theory of mathematical programming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global and finite convergence of a generalized Newton method for absolute value equations
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- Introduction to Piecewise Differentiable Equations
- Local linear convergence for alternating and averaged nonconvex projections
- Numerical comparisons based on four smoothing functions for absolute value equation
- On construction of new NCP functions
- On equivalent reformulations for absolute value equations
- On generalized Traub's method for absolute value equations
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- On the local convergence of the Douglas-Rachford algorithm
- Properties and construction of NCP functions
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Regularity properties of non-negative sparsity sets
- Solving absolute value equation using complementarity and smoothing functions
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- SOR-like iteration method for solving absolute value equations
- Systems of linear interval equations
- The Picard-HSS iteration method for absolute value equations
- Union averaged operators with applications to proximal algorithms for MIN-convex functions
Cited in
(17)- Inexact alternating direction method for the sparest solution of absolute value equations
- Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations
- Absolute value equations with data uncertainty in the l₁ and l_\infty norm balls
- Modulus-based matrix splitting methods for complex linear complementarity problem
- On finite termination of the generalized Newton method for solving absolute value equations
- Method of Alternating Projection for the Absolute Value Equation
- Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
- An efficient Newton-type matrix splitting algorithm for solving generalized absolute value equations with application to ridge regression problems
- Further study on two fixed point iterative schemes for absolute value equations
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
- Solutions for underdetermined generalized absolute value equations
- An iterative method based on Simpson's 3/8 rule to solve absolute value equations
- Smoothing the absolute value equations by the component-wise analysis
- Randomized iterative methods for generalized absolute value equations: solvability and error bounds
- Introducing three new smoothing functions: analysis on smoothing-Newton algorithms
- A new smoothing Newton-type two-step algorithm to solve non-Lipschitz absolute value equations of the form \(Ax + B|x|^p = b\)
- Absolute value inequalities
This page was built for publication: Method of alternating projections for the general absolute value equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111941)
