Solution of general linear complementarity problems via nondifferentiable concave minimization

zbMATH Open0895.90167MaRDI QIDQ1384433FDOQ1384433

Publication date: 13 April 1998

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Recommendations

Solution of nonsmooth generalized complementarity problems
A generalized nonlinear complementarity problems
scientific article; zbMATH DE number 1121086
A method for solving nonlinear complementarity problems and its convergence properties
On the solution of nonlinear complementarity problems
Optimal solutions to a class of nonconvex minimization problems with linear inequality constraints
Unconstrained minimization approaches to nonlinear complementarity problems
scientific article; zbMATH DE number 1206027
A linearization method for generalized complementarity problems
A constraint linearization method for nondifferentiable convex minimization

minimum principle necessary optimality condition nondifferentiable concave function successive linearization

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (22)

Feasibility Pump-like heuristics for mixed integer problems
Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
Robust \(L_p\)-norm least squares support vector regression with feature selection
Robust recursive absolute value inequalities discriminant analysis with sparseness
Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
Absolute value programming
A study of the difference-of-convex approach for solving linear programs with complementarity constraints
On solving difference of convex functions programs with linear complementarity constraints
Knapsack feasibility as an absolute value equation solvable by successive linear programming
Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
A new concave minimization algorithm for the absolute value equation solution
A hybrid algorithm for solving the absolute value equation
Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
Absolute value equation solution via concave minimization
A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
A convex analytic approach to risk-aware Markov decision processes
Solution point differentiability without strict complementarity in nonlinear programming
Binary classification via spherical separator by DC programming and DCA
Linear complementarity as absolute value equation solution
Convergence of SSOR methods for linear complementarity problems

This page was built for publication: Solution of general linear complementarity problems via nondifferentiable concave minimization

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