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 22 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)
- On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability (Q870195) (← 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)
- Solution point differentiability without strict complementarity in nonlinear programming (Q3688116) (← links)
- A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem (Q3706829) (← links)
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach (Q4884045) (← links)
- A Convex Analytic Approach to Risk-Aware Markov Decision Processes (Q5258943) (← links)
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
- Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems (Q6601202) (← links)
