Absolute value equation solution via linear programming
From MaRDI portal
Recommendations
- Absolute value equation solution via dual complementarity
- Absolute value equation solution via concave minimization
- Primal-dual bilinear programming solution of the absolute value equation
- A hybrid algorithm for solving the absolute value equation
- 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 equation solution via dual complementarity
- Absolute value equations
- Absolute value programming
- An algorithm for computing all solutions of an absolute value equation
- 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
- Primal-dual bilinear programming solution of the absolute value equation
Cited in
(31)- Bounds for the solutions of absolute value equations
- Direct solution of piecewise linear systems
- Convergence results for some piecewise linear solvers
- Primal-dual bilinear programming solution of the absolute value equation
- Relaxation maximum-based iteration method for solving the generalized absolute value equation
- 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
- Absolute value equations
- Absolute value programming
- Convergence of the modified Newton-type iteration method for the generalized absolute value equation
- Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
- The sparsest solution to the system of absolute value equations
- Solving absolute value equation using complementarity and smoothing functions
- A generalized Newton method for 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
- Absolute value equation solution via dual complementarity
- Explicit gradient information in multiobjective optimization
- A hybrid algorithm for solving the absolute value equation
- Bounding the solutions of Sylvester-like absolute value equation
- Absolute value equation solution via concave minimization
- 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
- Some techniques for solving absolute value equations
- A branch-and-bound method for absolute value programs
- A sub-additive DC approach to the complementarity problem
- A new semi-smooth Newton method for absolute value equations
- Linear complementarity as absolute value equation solution
- Minimum norm solution of the absolute value equations via simulated annealing algorithm
- Two maximum-based fixed-point methods for the generalized absolute value equation
This page was built for publication: Absolute value equation solution via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398653)
