Hossein Moosaei, Saeed Ketabchi, and Milan Hladík. Optimal correction of the absolute value equations. J. Glob. Optim., 79(3):645–667, 2021.
[PDF] [gzipped postscript] [postscript] [HTML]
In this paper, we study the optimum correction of the absolute value equations through making minimal changes in the coefficient matrix and the right hand side vector and using spectral norm. This problem can be formulated as a non-differentiable, non-convex and unconstrained fractional quadratic programming problem. The regularized least squares is applied for stabilizing the solution of the fractional problem. The regularized problem is reduced to a unimodal single variable minimization problem and to solve it a bisection algorithm is proposed. The main difficulty of the algorithm is a complicated constraint optimization problem, for which two novel methods are suggested. We also present optimality conditions and bounds for the norm of the optimal solutions. Numerical experiments are given to demonstrate the effectiveness of suggested methods.
@article{MooKet2021a,
author = "Hossein Moosaei and Saeed Ketabchi and Milan Hlad\'{\i}k",
title = "Optimal correction of the absolute value equations",
journal = "J. Glob. Optim.",
fjournal = "Journal of Global Optimization",
volume = "79",
number = "3",
pages = "645-667",
year = "2021",
doi = "10.1007/s10898-020-00948-2",
issn = "1573-2916",
bib2html_dl_html = "https://doi.org/10.1007/s10898-020-00948-2",
bib2html_dl_pdf = "https://rdcu.be/cf5cH",
abstract = "In this paper, we study the optimum correction of the absolute value equations through making minimal changes in the coefficient matrix and the right hand side vector and using spectral norm. This problem can be formulated as a non-differentiable, non-convex and unconstrained fractional quadratic programming problem. The regularized least squares is applied for stabilizing the solution of the fractional problem. The regularized problem is reduced to a unimodal single variable minimization problem and to solve it a bisection algorithm is proposed. The main difficulty of the algorithm is a complicated constraint optimization problem, for which two novel methods are suggested. We also present optimality conditions and bounds for the norm of the optimal solutions. Numerical experiments are given to demonstrate the effectiveness of suggested methods.",
keywords = "Absolute value equation; Infeasible system; Non-convex optimization; Non-differentiable problem; Regularization technique",
}
Generated by bib2html.pl (written by Patrick Riley ) on Mon Apr 15, 2024 08:26:42