A numerical approach to optimization problems with variational inequality constraints
From MaRDI portal
Recommendations
- On Optimization Problems with Variational Inequality Constraints
- Solving two-level variational inequality
- On the numerical solution of a variational inequality.
- Improving the solution of variational inequalities based on the optimization approach
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
Cites work
- scientific article; zbMATH DE number 433010 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 4211817 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 193559 (Why is no real title available?)
- scientific article; zbMATH DE number 3539962 (Why is no real title available?)
- scientific article; zbMATH DE number 513091 (Why is no real title available?)
- scientific article; zbMATH DE number 688033 (Why is no real title available?)
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- A mathematical programming approach for determining oligopolistic market equilibrium
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- Double penalty method for bilevel optimization problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Generalized Nash games and quasi-variational inequalities
- Iterative Solution of Nonlinear Equations in Several Variables
- Minimization of Locally Lipschitzian Functions
- Necessary optimality conditions for Stackelberg problems
- Network design problem with congestion effects: A case of bilevel programming
- On the basic theorem of complementarity
- On the numerical solution of a class of Stackelberg problems
- Optimization and nonsmooth analysis
- Paths to constrained Nash equilibria
- Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Solution differentiability for variational inequalities
- Strongly Regular Generalized Equations
- The Generalized Quasi-Variational Inequality Problem
- Two characterization theorems in complementarity theory
- Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
Cited in
(52)- scientific article; zbMATH DE number 829961 (Why is no real title available?)
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- scientific article; zbMATH DE number 6093223 (Why is no real title available?)
- Equilibrium problems with complementarity constraints: case study with applications to oligopolistic markets
- Numerical reduced variable optimization methods via implicit functional dependence with applications
- On the SQH method for solving optimal control problems with non-smooth state cost functionals or constraints
- Une méthode numérique pour les problèmes variationnels sous contrainte de convexité
- Active set algorithm for mathematical programs with linear complementarity constraints
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- A new smoothing technique for mathematical programs with equilibrium constraints
- Exact penalty functions for convex bilevel programming problems.
- Bilevel and multilevel programming: A bibliography review
- scientific article; zbMATH DE number 66883 (Why is no real title available?)
- A generalized project metric algorithm for mathematical programs with equilibrium constraints
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- A cutting hyperplane projection method for solving generalized quasi-variational inequalities
- Two numerical schemes for general variational inequalities
- A short state of the art on multi-leader-follower games
- Bilevel optimization methods in imaging
- On Optimization Problems with Variational Inequality Constraints
- Computational discretization algorithms for functional inequality constrained optimization
- Solving two-level variational inequality
- Adaptive finite elements for optimally controlled elliptic variational inequalities of obstacle type
- On the numerical solution of a variational inequality.
- Augmented Lagrangian neural network for solving mathematical programs with equilibrium constraints
- Optimal prestress of structures with frictional unilateral contact interfaces
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- An entropic regularization approach for mathematical programs with equilibrium constraints
- Some projection methods with the BB step sizes for variational inequalities
- Mathematical programs with equilibrium constraints: A brief survey of methods and optimality conditions
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- A method with convergence rates for optimization problems with variational inequality constraints
- An improved hyperplane projection method for generalized Nash equilibrium problems with extrapolation technique
- Global optimization from concave minimization to concave mixed variational inequality
- Stochastic mathematical programs with equilibrium constraints
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- New relaxation method for mathematical programs with complementarity constraints
- Bundle trust-region algorithm for bilinear bilevel programming
- Complementarity problems in GAMS and the PATH solver
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities.
- A note on a class of equilibrium problems with equilibrium constraints.
- Some projection-like methods for the generalized Nash equilibria
- A Newton method for a class of quasi-variational inequalities
- A new descent algorithm for solving quadratic bilevel programming problems.
This page was built for publication: A numerical approach to optimization problems with variational inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804370)
