Primal-dual bilinear programming solution of the absolute value equation

DOI10.1007/S11590-011-0347-6MaRDI QIDQ694190zbMATH OpenOpenAlexFDO

Authors O. L. Mangasarian

Publication date 11 December 2012

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL http://digital.library.wisc.edu/1793/64356

zbMATH Keywords

absolute value equationbilinear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Absolute value equation solution via linear programming
• Absolute value equation solution via dual complementarity
• A hybrid algorithm for solving the absolute value equation
• Absolute value equation solution via concave minimization
• Absolute value programming

Cites work

• 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
• Bilinear separation of two sets in n-space
• Complementary pivot theory of mathematical programming
• Convex Analysis
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• NP-completeness of the linear complementarity problem
• On equivalent reformulations for absolute value equations
• On unique solvability of the absolute value equation

Cited in

(24)

• Unified smoothing functions for absolute value equation associated with second-order cone
• The relaxed nonlinear PHSS-like iteration method for absolute value equations
• Sufficient conditions for the unsolvability and solvability of the absolute value equation
• Numerical comparisons based on four smoothing functions for absolute value equation
• Absolute value equation solution via dual complementarity
• Neural network based on systematically generated smoothing functions for absolute value equation
• A smoothing Newton method for absolute value equation associated with second-order cone
• The proximal methods for solving absolute value equation
• On the solvability and Picard-type method for absolute value matrix equations
• On Picard-SHSS iteration method for absolute value equation
• Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations
• Absolute value equations with uncertain data
• Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
• Linear complementarity as absolute value equation solution
• Absolute value equation solution via linear programming
• Picard splitting method and Picard CG method for solving the absolute value equation
• A hybrid algorithm for solving the absolute value equation
• TWO CSCS-BASED ITERATION METHODS FOR SOLVING ABSOLUTE VALUE EQUATIONS
• Inexact Newton-type method for solving large-scale absolute value equation \(Ax-|x|=b\).
• An overview of absolute value equations: from theory to solution methods and challenges
• Two maximum-based fixed-point methods for the generalized absolute value equation
• Exploring two new iterative methods for solving absolute value equations
• Two efficient iteration methods for solving the absolute value equations
• SOR-unrolled learning-to-solve method for absolute value equations

Describes a project that uses

Uses Software

• CPLEX
• Matlab

This page was built for publication: Primal-dual bilinear programming solution of the absolute value equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694190)