Pages that link to "Item:Q1384433"
From MaRDI portal
The following pages link to Solution of general linear complementarity problems via nondifferentiable concave minimization (Q1384433):
Displaying 14 items.
- A hybrid algorithm for solving the absolute value equation (Q499704) (← links)
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) (Q650241) (← links)
- Convergence of SSOR methods for linear complementarity problems (Q833585) (← links)
- Absolute value programming (Q885823) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- Robust \(L_p\)-norm least squares support vector regression with feature selection (Q1735423) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- A new concave minimization algorithm for the absolute value equation solution (Q2047210) (← links)
- Robust recursive absolute value inequalities discriminant analysis with sparseness (Q2292206) (← links)
- Binary classification via spherical separator by DC programming and DCA (Q2393067) (← links)
- Linear complementarity as absolute value equation solution (Q2448218) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Absolute value equation solution via concave minimization (Q2458899) (← links)
