On some connections among variational inequalities, combinatorial and continuous optimization
From MaRDI portal
Publication:1904715
DOI10.1007/BF02032131zbMath0844.90069MaRDI QIDQ1904715
Publication date: 1 February 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02032131
90C10: Integer programming
90C26: Nonconvex programming, global optimization
49J40: Variational inequalities
90C27: Combinatorial optimization
Related Items
Penalty method for a class of differential variational inequalities, ON THE CONSTRUCTION OF GAP FUNCTIONS FOR VARIATIONAL INEQUALITIES VIA CONJUGATE DUALITY, Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality, Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition, Existence results and gap functions for the generalized equilibrium problem with composed functions, On the gap functions of prevariational inequalities, Individual confidence intervals for solutions to expected value formulations of stochastic variational inequalities, Merit functions and error bounds for constrained mixed set-valued variational inequalities via generalizedf-projection operators, Connections among constrained continuous and combinatorial vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theorems of the alternative for multifunctions with applications to optimization: General results
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Lagrangean duality for facial programs with applications to integer and complementarity problems
- An extended descent framework for variational inequalities
- Theorems of the alternative and optimality conditions
- The Piecewise Concave Function
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints