Computing stationary points
From MaRDI portal
Publication:4158821
DOI10.1007/BFb0120778zbMath0379.90081OpenAlexW1582414340MaRDI QIDQ4158821
Publication date: 1978
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120778
Related Items (20)
Iterative methods for variational and complementarity problems ⋮ Newton's method for a class of nonsmooth functions ⋮ A globally convergent Newton method for solving strongly monotone variational inequalities ⋮ On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method ⋮ A proximal decomposition algorithm for variational inequality problems. ⋮ Inexact operator splitting methods with selfadaptive strategy for variational inequality problems ⋮ An affine scaling interior trust region method via optimal path for solving monotone variational inequality problem with linear constraints ⋮ A new alternating direction method for co-coercive variational inequality problems ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Exploring multiple equilibria for symmetric \(2\times 2\) CES/LES pure exchange economies ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ An alternating direction method for general variational inequalities ⋮ An operator splitting method for variational inequalities with partially unknown mappings ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem ⋮ A hybrid method for solving variational inequality problems ⋮ Simplicial zero-point algorithms: A unifying description ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ A note on the Talman, Van der Heyden linear complementarity algorithm ⋮ A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
This page was built for publication: Computing stationary points
