Absolute value equation solution via dual complementarity
From MaRDI portal
Recommendations
- Absolute value equation solution via linear programming
- Primal-dual bilinear programming solution of the absolute value equation
- A hybrid algorithm for solving the absolute value equation
- Absolute value equation solution via concave minimization
- A generalized Newton method for absolute value equations
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- A generalized Newton method for absolute value equations
- A note on absolute value equations
- A residual existence theorem for linear equations
- A theorem of the alternatives for the equationAx+B|x| =b
- Absolute value equation solution via concave minimization
- Absolute value equations
- Absolute value programming
- An algorithm for computing the hull of the solution set of interval linear equations
- An algorithm for solving the absolute value equation
- Complementary pivot theory of mathematical programming
- Linear complementarity problems solvable by A single linear program
- NP-completeness of the linear complementarity problem
- On equivalent reformulations for absolute value equations
- On unique solvability of the absolute value equation
Cited in
(28)- Absolute value equation solution via linear programming
- Primal-dual bilinear programming solution of the absolute value equation
- Unsupervised and semisupervised classification via absolute value inequalities
- Unified smoothing functions for absolute value equation associated with second-order cone
- On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems
- Numerical comparisons based on four smoothing functions for absolute value equation
- Neural network based on systematically generated smoothing functions for absolute value equation
- The genetic algorithm for solving absolute value equation with the method of Rosenbrock
- From representation theorems to variational inequalities
- Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
- The sparsest solution to the system of absolute value equations
- An algorithm for computing all solutions of an absolute value equation
- Solving absolute value equation using complementarity and smoothing functions
- Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations
- Absolute value equations with uncertain data
- A DC algorithm for solving non-uniquely solvable absolute value equations
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- A generalized Newton method for absolute value equations associated with circular cones
- A hybrid algorithm for solving the absolute value equation
- Absolute value equation solution via concave minimization
- An algorithm for solving the absolute value equation
- Absolute value equations with data uncertainty in the $l_1$ and $l_\infty$ norm balls
- The proximal methods for solving absolute value equation
- A verification method for enclosing solutions of absolute value equations
- A smoothing Newton method for absolute value equation associated with second-order cone
- Picard splitting method and Picard CG method for solving the absolute value equation
- Levenberg-Marquardt method for absolute value equation associated with second-order cone
- Linear complementarity as absolute value equation solution
This page was built for publication: Absolute value equation solution via dual complementarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947610)
