Solution of linear complementarity problems using minimization with simple bounds
From MaRDI portal
Publication:1892604
DOI10.1007/BF01099464zbMath0835.90101OpenAlexW2018488624MaRDI QIDQ1892604
Sandra Augusta Santos, Ana Friedlander, José Mario 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
optimality conditionshorizontal linear complementarity problemglobal minimizersstationary pointsbound constrained minimization
Related Items
On the regularization of mixed complementarity problems, Solution of monotone complementarity problems with locally Lipschitzian functions, Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, Un algoritmo Newton inexacto para complementariedad horizontal, An optimization approach for unconfined seepage problem with semipermeable conditions, Newton-type Methods with Generalized Distances For Constrained Optimization, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗, A smoothing Levenberg-Marquardt method for the extended linear complementarity problem, On the solution of bounded and unbounded mixed complementarity problems, On the solution of the extended linear complementarity problem, New constrained optimization reformulation of complementarity problems, Derivative-free methods for monotone variational inequality and complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Nonlinear complementarity as unconstrained and constrained minimization
- A new trust region algorithm for bound constrained minimization
- Nonlinear complementarity as unconstrained optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Global Optimization Approach to the Linear Complementarity Problem
- On the Resolution of Linearly Constrained Convex Minimization Problems
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem