Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations

DOI10.3934/naco.2019029OpenAlexW2946674549MaRDI QIDQ2178954

Fakhrodin Hashemi, Saeed Ketabchi

Publication date: 12 May 2020

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2019029

zbMATH Keywords

smoothing functionnonconvex and nonsmoothdifference of convex functioninfeasible absolute value equations

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Linear ordinary differential equations and systems in the complex domain (34M03)

Related Items

Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods ⋮ Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations ⋮ Smoothing techniques in solving non-Lipschitz absolute value equations ⋮ A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions ⋮ The new iteration methods for solving absolute value equations. ⋮ The solution of a type of absolute value equations using two new matrix splitting iterative techniques ⋮ Unnamed Item ⋮ The proximal methods for solving absolute value equation ⋮ Smoothing approximations for piecewise smooth functions: a probabilistic approach ⋮ Two new fixed point iterative schemes for absolute value equations ⋮ The solution of the absolute value equations using two generalized accelerated overrelaxation methods

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
• A smoothing-type algorithm for absolute value equations
• Primal-dual bilinear programming solution of the absolute value equation
• Smoothing methods for nonsmooth, nonconvex minimization
• Absolute value equations
• Absolute value programming
• A generalized Newton method for absolute value equations
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Numerical comparisons based on four smoothing functions for absolute value equation
• Accelerating the DC algorithm for smooth functions
• Optimal error correction and methods of feasible directions
• Minimum norm solution to the absolute value equation in the convex case
• Absolute value equation solution via dual complementarity
• A note on absolute value equations
• Absolute value equation solution via concave minimization
• On equivalent reformulations for absolute value equations
• Tikhonov regularization for infeasible absolute value equations
• A simple proof of the Rademacher theorem
• A theorem of the alternatives for the equationAx+B|x| =b
• On Nonlinear Fractional Programming
• Benchmarking optimization software with performance profiles.