A DC algorithm for solving non-uniquely solvable absolute value equations
From MaRDI portal
Publication:6151443
Recommendations
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A generalized Newton method for absolute value equations
- A globally and quadratically convergent method for absolute value equations
- Absolute value equations
- An algorithm for computing all solutions of an absolute value equation
- Bounds for the solutions of absolute value equations
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 7260006 (Why is no real title available?)
- scientific article; zbMATH DE number 7695274 (Why is no real title available?)
- On unique solvability and Picard’s iterative method for absolute value equations
- On unique solvability of the absolute value equation
- Preconditioned conjugate gradient methods for absolute value equations
- Solving absolute value equation using complementarity and smoothing functions
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
Cited in
(5)- On unique solvability and a generalized Newton method for solving new general absolute value equations
- Discrete geometry and optimization
- An efficient DCA algorithm for solving non-monotone affine variational inequality problem
- Solving a class of bilevel programming problems by DC programming and DCA
- Absolute value equations with 2ⁿ solutions
This page was built for publication: A DC algorithm for solving non-uniquely solvable absolute value equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151443)