Solution of linear complementarity problems using minimization with simple bounds

DOI10.1007/BF01099464MaRDI QIDQ1892604zbMATH OpenOpenAlexFDO

Authors A. Friedlander, S. A. Santos, J. M. Martínez

Publication date 28 April 1996

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01099464

zbMATH Keywords

optimality conditionshorizontal linear complementarity problemglobal minimizersstationary pointsbound constrained minimization

Mathematics Subject Classification ID

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

Recommendations

• On the solution of the extended linear complementarity problem
• Bounds for the solution set of linear complementarity problems
• scientific article; zbMATH DE number 850978
• A quadratically nonsmooth convergent algorithm for the horizontal linear complementarity problem
• scientific article; zbMATH DE number 432996

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• A new trust region algorithm for bound constrained minimization
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Global Optimization Approach to the Linear Complementarity Problem
• Nonlinear complementarity as unconstrained and constrained minimization
• Nonlinear complementarity as unconstrained optimization
• On the Resolution of Linearly Constrained Convex Minimization Problems

Cited in

(18)

• Solution of horizontal linear complementarity problems using multi-objective programming approach and fuzzy approach
• Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
• A smoothing Levenberg-Marquardt method for the extended linear complementarity problem
• New constrained optimization reformulation of complementarity problems
• Mixed Nonlinear Complementarity Problems via Nonlinear Optimization: Numerical Results on Multi-Rigid-Body Contact Problems with Friction
• Derivative-free methods for monotone variational inequality and complementarity problems
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• On the solution of the extended linear complementarity problem
• Solution of monotone complementarity problems with locally Lipschitzian functions
• Newton-type Methods with Generalized Distances For Constrained Optimization
• An inexact Newton algorithm for horizontal complementarity
• Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗
• The Linear Complementarity Problems with a Few Variables per Constraint
• An optimization approach for unconfined seepage problem with semipermeable conditions
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Bounds for the solution set of linear complementarity problems
• On the regularization of mixed complementarity problems
• On the solution of bounded and unbounded mixed complementarity problems

This page was built for publication: Solution of linear complementarity problems using minimization with simple bounds

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