A numerical approach to optimization problems with variational inequality constraints
type: Item
instance of: scholarly article
title: A numerical approach to optimization problems with variational inequality constraints
zbMATH Open document ID: 0835.90093
DOI: 10.1007/BF01585759
author: J. Zowe
author: Jiří Outrata
published in: Mathematical Programming. Series A. Series B
publication date: 1995-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 754874
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: generalized Jacobian
zbMATH Keywords: optimization
zbMATH Keywords: variational inequality constraints
zbMATH Keywords: constrained minimization
zbMATH Keywords: local Lipschitz function
zbMATH Keywords: non-differentiable optimization
zbMATH Keywords: subgradients
zbMATH Keywords: Stackelberg- Cournot-Nash equilibria
describes a project that uses: NLPQL
MaRDI profile type: Publication
cites work: Q4281784
cites work: Q3782303
cites work: The Generalized Quasi-Variational Inequality Problem
cites work: Optimization and nonsmooth analysis
cites work: On the basic theorem of complementarity
cites work: Paths to constrained Nash equilibria
cites work: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
cites work: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
cites work: Q3360013
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Generalized Nash games and quasi-variational inequalities
cites work: Q4040359
cites work: Double penalty method for bilevel optimization problems
cites work: Q3139157
cites work: Q4313476
cites work: Solution differentiability for variational inequalities
cites work: Q3316093
cites work: Network design problem with congestion effects: A case of bilevel programming
cites work: Q4115720
cites work: A mathematical programming approach for determining oligopolistic market equilibrium
cites work: Iterative Solution of Nonlinear Equations in Several Variables
cites work: On the numerical solution of a class of Stackelberg problems
cites work: Necessary optimality conditions for Stackelberg problems
cites work: Two characterization theorems in complementarity theory
cites work: Minimization of Locally Lipschitzian Functions
cites work: Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
cites work: Strongly Regular Generalized Equations
cites work: An Implicit-Function Theorem for a Class of Nonsmooth Functions
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
cites work: Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
full work available at URL: https://doi.org/10.1007/bf01585759
OpenAlex ID: W2065428088
description: scientific article; zbMATH DE number 754874