A generalized Newton method for absolute value equations associated with second order cones
DOI10.1016/j.cam.2010.08.036zbMath1204.65065MaRDI QIDQ609239
Zheng-Hai Huang, Qiong Zhang, Sheng-Long Hu
Publication date: 30 November 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.08.036
numerical results; linear complementarity problem; generalized Newton algorithm; local quadratic convergence; absolute value equations; second order cone; global linear convergence
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C05: Linear programming
90C53: Methods of quasi-Newton type
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
15A06: Linear equations (linear algebraic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A globally and quadratically convergent method for absolute value equations
- Absolute value equations
- Absolute value programming
- Smoothing algorithms for complementarity problems over symmetric cones
- A generalized Newton method for absolute value equations
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- On programming with absolute value functions
- Second-order cone programming
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A note on absolute value equations
- A nonsmooth version of Newton's method
- Absolute value equation solution via concave minimization
- A descent method for a reformulation of the second-order cone complementarity problem
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- On equivalent reformulations for absolute value equations
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A theorem of the alternatives for the equationAx+B|x| =b
- Technical Note—“Linear” Programming with Absolute-Value Functionals