A numerical approach to optimization problems with variational inequality constraints
From MaRDI portal
Publication:1804370
DOI10.1007/BF01585759zbMath0835.90093OpenAlexW2065428088MaRDI QIDQ1804370
Publication date: 11 June 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585759
optimizationsensitivity analysisnon-differentiable optimizationconstrained minimizationgeneralized Jacobiansubgradientslocal Lipschitz functionStackelberg- Cournot-Nash equilibriavariational inequality constraints
Nonlinear programming (90C30) Variational inequalities (49J40) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A cutting hyperplane projection method for solving generalized quasi-variational inequalities, An improved hyperplane projection method for generalized Nash equilibrium problems with extrapolation technique, A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints, Bilevel and multilevel programming: A bibliography review, An entropic regularization approach for mathematical programs with equilibrium constraints, Global convergence of a smooth approximation method for mathematical programs with complementarity constraints, Optimal prestress of structures with frictional unilateral contact interfaces, On the SQH method for solving optimal control problems with non-smooth state cost functionals or constraints, An interior point method for nonlinear optimization with a quasi-tangential subproblem, Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation, New relaxation method for mathematical programs with complementarity constraints, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities, Stochastic mathematical programs with equilibrium constraints, A new smoothing technique for mathematical programs with equilibrium constraints, An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities, A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints, Equilibrium problems with complementarity constraints: case study with applications to oligopolistic markets, Active set algorithm for mathematical programs with linear complementarity constraints, A semidefinite programming heuristic for quadratic programming problems with complementarity constraints, A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, A modified relaxation scheme for mathematical programs with complementarity constraints, Some projection-like methods for the generalized Nash equilibria, Exact penalty functions for convex bilevel programming problems., Unnamed Item, A Newton method for a class of quasi-variational inequalities, Unnamed Item, Some projection methods with the BB step sizes for variational inequalities, Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities., Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions, A new descent algorithm for solving quadratic bilevel programming problems., A Short State of the Art on Multi-Leader-Follower Games, Adaptive Finite Elements for Optimally Controlled Elliptic Variational Inequalities of Obstacle Type, A generalized project metric algorithm for mathematical programs with equilibrium constraints, Complementarity problems in GAMS and the PATH solver, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, Bundle trust-region algorithm for bilinear bilevel programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- Solution differentiability for variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Two characterization theorems in complementarity theory
- Generalized Nash games and quasi-variational inequalities
- Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
- Double penalty method for bilevel optimization problems
- Necessary optimality conditions for Stackelberg problems
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Paths to constrained Nash equilibria
- On the numerical solution of a class of Stackelberg problems
- Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
- Optimization and nonsmooth analysis
- Network design problem with congestion effects: A case of bilevel programming
- Strongly Regular Generalized Equations
- A mathematical programming approach for determining oligopolistic market equilibrium
- The Generalized Quasi-Variational Inequality Problem
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- Minimization of Locally Lipschitzian Functions
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Iterative Solution of Nonlinear Equations in Several Variables
- On the basic theorem of complementarity
