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

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

Cites Work

Title not available (Why is that?)
Benchmarking optimization software with performance profiles.
Convex analysis approach to d. c. programming: Theory, algorithms and applications
On Nonlinear Fractional Programming
Title not available (Why is that?)
Smoothing methods for nonsmooth, nonconvex minimization
Absolute value equation solution via concave minimization
Absolute value equations
Absolute value programming
Absolute value equation solution via dual complementarity
A generalized Newton method for absolute value equations
A theorem of the alternatives for the equationAx+B|x| =b
On equivalent reformulations for absolute value equations
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
A note on absolute value equations
Primal-dual bilinear programming solution of the absolute value equation
Minimum norm solution to the absolute value equation in the convex case
Accelerating the DC algorithm for smooth functions
A simple proof of the Rademacher theorem
Numerical comparisons based on four smoothing functions for absolute value equation
Tikhonov regularization for infeasible absolute value equations
Optimal error correction and methods of feasible directions

Cited In (13)

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

This page was built for publication: Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations

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