Pages that link to "Item:Q4342957"
From MaRDI portal
The following pages link to Merit functions and descent algorithms for a class of variational ineqality problems (Q4342957):
Displaying 11 items.
- Projected subgradient method for non-Lipschitz set-valued mixed variational inequalities (Q414266) (← links)
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions (Q934791) (← links)
- Descent method with inexact linesearch for mixed variational inequalities (Q1037072) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- On the convergence of descent methods for monotone variational inequalities (Q1890950) (← links)
- Merit functions for absolute value variational inequalities (Q2142807) (← links)
- On the coerciveness of some merit functions for complementarity problems over symmetric cones (Q2644046) (← links)
- A New Merit Function and a Successive Quadratic Programming Algorithm for Variational Inequality Problems (Q4895617) (← links)
- Merit function for variational-like inequalitiets (Q4943144) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)
- A merit function approach to the subgradient method with averaging (Q5459823) (← links)
