Absolute value programming
From MaRDI portal
Publication:885823
DOI10.1007/s10589-006-0395-5zbMath1278.90386OpenAlexW2046904496MaRDI QIDQ885823
Publication date: 14 June 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-0395-5
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (only showing first 100 items - show all)
Optimal correction of infeasible equations system as Ax + B|x|= b using ℓ p-norm regularization ⋮ Duality of optimization problems with gauge functions ⋮ Direct solution of piecewise linear systems ⋮ Unified smoothing functions for absolute value equation associated with second-order cone ⋮ Solving tensor absolute value equation ⋮ Duality of nonconvex optimization with positively homogeneous functions ⋮ A shift splitting iteration method for generalized absolute value equations ⋮ Unsupervised and semisupervised classification via absolute value inequalities ⋮ A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem ⋮ Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes ⋮ A generalization of the AOR iteration method for solving absolute value equations ⋮ Further study on tensor absolute value equations ⋮ Modified bas iteration method for absolute value equation ⋮ A special shift splitting iteration method for absolute value equation ⋮ A relaxed generalized Newton iteration method for generalized absolute value equations ⋮ On the unique solvability of the absolute value equation ⋮ On the global convergence of the inexact semi-smooth Newton method for absolute value equation ⋮ A modified generalized Newton method for absolute value equations ⋮ On the modified Hermitian and skew-Hermitian splitting iteration methods for a class of weakly absolute value equations ⋮ A modified fixed point iteration method for solving the system of absolute value equations ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ A Preconditioned AOR Iterative Method for the Absolute Value Equations ⋮ An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side ⋮ On equivalent reformulations for absolute value equations ⋮ Sufficient conditions for the unsolvability and solvability of the absolute value equation ⋮ Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations ⋮ A generalized Newton method for absolute value equations associated with second order cones ⋮ The unique solution of the absolute value equations ⋮ Modulus-based circulant and skew-circulant splitting iteration method for the linear complementarity problem with a Toeplitz matrix ⋮ Convergence results for some piecewise linear solvers ⋮ On the solution of general absolute value equations ⋮ Absolute value equation solution via linear programming ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ A new SOR-like method for solving absolute value equations ⋮ Modified Newton-type iteration methods for generalized absolute value equations ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations ⋮ On finite termination of the generalized Newton method for solving absolute value equations ⋮ Residual iterative method for solving absolute value equations ⋮ A modified generalized SOR-like method for solving an absolute value equation ⋮ Smoothing techniques in solving non-Lipschitz absolute value equations ⋮ Minimum norm solution of the absolute value equations via simulated annealing algorithm ⋮ A globally and quadratically convergent method for absolute value equations ⋮ Relaxed-based matrix splitting methods for solving absolute value equations ⋮ A New Fixed-Time Dynamical System for Absolute Value Equations ⋮ Shift-splitting fixed point iteration method for solving generalized absolute value equations ⋮ Error bounds and a condition number for the absolute value equations ⋮ A verification method for enclosing solutions of absolute value equations ⋮ An inertial inverse-free dynamical system for solving absolute value equations ⋮ Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation ⋮ Absolute value equation solution via dual complementarity ⋮ Generalized AOR method for solving absolute complementarity problems ⋮ Stochastic absolute value equations ⋮ A note on absolute value equations ⋮ Unnamed Item ⋮ Modified SOR-like method for absolute value equations ⋮ The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm ⋮ Linear complementarity as absolute value equation solution ⋮ Unnamed Item ⋮ Interval algorithm for absolute value equations ⋮ Picard splitting method and Picard CG method for solving the absolute value equation ⋮ On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems ⋮ A modified SOR-like method for absolute value equations associated with second order cones ⋮ Robust \(L_p\)-norm least squares support vector regression with feature selection ⋮ Some techniques for solving absolute value equations ⋮ A generalized Newton method for absolute value equations associated with circular cones ⋮ Convergent conditions of the generalized Newton method for absolute value equation over second order cones ⋮ A hybrid algorithm for solving the absolute value equation ⋮ Numerical comparisons based on four smoothing functions for absolute value equation ⋮ Weaker convergent results of the generalized Newton method for the generalized absolute value equations ⋮ A dynamic model to solve the absolute value equations ⋮ Tensor absolute value equations ⋮ Bounds for the solutions of absolute value equations ⋮ A branch-and-bound method for absolute value programs ⋮ A theorem of the alternatives for the equation \(|Ax|-|B||x|=b\) ⋮ An algorithm for computing all solutions of an absolute value equation ⋮ On an iterative method for solving absolute value equations ⋮ Primal-dual bilinear programming solution of the absolute value equation ⋮ Optimal error correction and methods of feasible directions ⋮ A residual existence theorem for linear 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 ⋮ On the SOR-like iteration method for solving absolute value equations ⋮ Newton-based matrix splitting method for generalized absolute value equation ⋮ On unique solvability of the absolute value equation ⋮ A generalized Newton method for absolute value equations ⋮ An inverse-free dynamical system for solving the absolute value equations ⋮ Robust recursive absolute value inequalities discriminant analysis with sparseness ⋮ Equilibrium problems involving the Lorentz cone ⋮ On the unique solution of the generalized absolute value equation ⋮ A new concave minimization algorithm for the absolute value equation solution ⋮ Tikhonov regularization for infeasible absolute value equations ⋮ Unsupervised classification via convex absolute value inequalities ⋮ Modified HS conjugate gradient method for solving generalized absolute value equations ⋮ Levenberg-Marquardt method for absolute value equation associated with second-order cone ⋮ Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems ⋮ Global and finite convergence of a generalized Newton method for absolute value equations ⋮ Unnamed Item ⋮ Method of alternating projections for the general absolute value equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Systems of linear interval equations
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- The linear complementarity problem as a separable bilinear program
- Complementary pivot theory of mathematical programming
- Nonlinear Perturbation of Linear Programs
- A theorem of the alternatives for the equationAx+B|x| =b
This page was built for publication: Absolute value programming
