Derivative-free methods for monotone variational inequality and complementarity problems
From MaRDI portal
Publication:1273171
DOI10.1023/A:1021712513685zbMath0913.90251OpenAlexW1935963101MaRDI QIDQ1273171
Publication date: 7 March 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021712513685
unconstrained optimizationconstrained optimizationbox constraintsderivative-free methodsNCP functionsmonotone variational inequality problems
Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- A linearly convergent derivative-free descent method for strongly monotone complementarity problems
- Nonlinear complementarity as unconstrained and constrained minimization
- Unconstrained optimization reformulations of variational inequality problems
- Equivalence of variational inequality problems to unconstrained minimization
- New NCP-functions and their properties
- Convexity of the implicit Lagrangian
- Global method for monotone variational inequality problems with inequality constraints
- On the resolution of monotone complementarity problems
- Solution of linear complementarity problems using minimization with simple bounds
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained optimization
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A special newton-type optimization method
- Global Methods for Nonlinear Complementarity Problems
