Optimization and variational inequalities with pseudoconvex functions
DOI10.1007/s10957-010-9682-5zbMath1229.90198OpenAlexW2092972652MaRDI QIDQ613581
Publication date: 21 December 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9682-5
nonsmooth optimizationcharacterizations of the solution set of the nonlinear programming problempseudo-convex functionsvariational inequalities of differential type
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the Minty vector variational principle
- A simple characterization of solutions sets of convex programs
- Complementarity problems over cones with monotone and pseudomonotone maps
- Minty variational inequalities, increase-along-rays property and optimization
- Seven kinds of monotone maps
- Generalized monotonicity and generalized convexity
- On characterizing the solution sets of pseudolinear programs
- Second-order optimality conditions for problems with \(C^{1}\) data
- Existence of solutions and star-shapedness in Minty variational inequalities
- On variational inequalities and nonlinear programming problem
- Pseudo-Convex Functions
- On the generalization of a direct method of the calculus of variations
- Sur les inégalités linéaires
This page was built for publication: Optimization and variational inequalities with pseudoconvex functions