Minimum norm solution to the absolute value equation in the convex case
From MaRDI portal
Publication:1937019
DOI10.1007/s10957-012-0044-3zbMath1256.90031OpenAlexW2011309441MaRDI QIDQ1937019
Hossein Moosaei, Saeed Ketabchi
Publication date: 11 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0044-3
generalized Newton methodabsolute value equationminimum norm solutionsolution sets of convex programs
Related Items
Unified smoothing functions for absolute value equation associated with second-order cone, An improved two-sweep iteration method for absolute value equations, Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations, Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations, Absolute value equations with data uncertainty in the $l_1$ and $l_\infty$ norm balls, Absolute value equations with uncertain data, A modified generalized SOR-like method for solving an absolute value equation, Smoothing techniques in solving non-Lipschitz absolute value equations, Unnamed Item, Unnamed Item, Picard splitting method and Picard CG method for solving the absolute value equation, A modified SOR-like method for absolute value equations associated with second order cones, SOR-like iteration method for solving absolute value equations, Numerical comparisons based on four smoothing functions for absolute value equation, A dynamic model to solve the absolute value equations, Levenberg-Marquardt method for solving systems of absolute value equations, 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, Optimal correction of the absolute value equations, A quadratically convergent descent method for the absolute value equation \(Ax + B |x| = b\), Tikhonov regularization for infeasible absolute value equations, The proximal methods for solving absolute value equation, Levenberg-Marquardt method for absolute value equation associated with second-order cone, An improvement on parametric \(\nu\)-support vector algorithm for classification, Smooth augmented Lagrangian method for twin bounded support vector machine, The sparsest solution to the system of absolute value equations
Cites Work
- Unnamed Item
- Unnamed Item
- A Newton method for linear programming
- Absolute value equations
- A simple characterization of solutions sets of convex programs
- On the minimum norm solution of linear programs
- On the solution set of convex problems and its numerical application
- Complementary pivot theory of mathematical programming
