Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
type: Item
instance of: scholarly article
title: Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
zbMATH Open document ID: 0892.90169
DOI: 10.1023/A:1022601017090
published in: Journal of Optimization Theory and Applications
publication date: 1997-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 1071854
zbMATH Keywords: box constrained optimization
zbMATH Keywords: variational inequality
zbMATH Keywords: smooth minimization
author: R. Andreani
author: A. Friedlander
author: J. M. Martínez
describes a project that uses: HOMPACK
MaRDI profile type: Publication
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Q4003375
cites work: Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
cites work: On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
cites work: A class of linear complementarity problems solvable in polynomial time
cites work: Q4257419
cites work: Solution of linear complementarity problems using minimization with simple bounds
cites work: A new strategy for solving variational inequalities in bounded polytopes∗
cites work: Nonlinear complementarity as unconstrained optimization
cites work: Nonlinear complementarity as unconstrained and constrained minimization
cites work: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: A new trust region algorithm for bound constrained minimization
cites work: The gap function of a convex program
cites work: A New Merit Function and a Successive Quadratic Programming Algorithm for Variational Inequality Problems
cites work: Q4257435
cites work: Unconstrained optimization reformulations of variational inequality problems
cites work: On the Resolution of Linearly Constrained Convex Minimization Problems
cites work: Tensor Methods for Unconstrained Optimization Using Second Derivatives
cites work: Q4135211
cites work: Algorithm 652
cites work: Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
cites work: Q4257421
cites work: A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
full work available at URL: a:1022601017090
OpenAlex ID: W1658700537
description: scientific article; zbMATH DE number 1071854