Characterizations of the solution sets of convex programs and variational inequality problems
From MaRDI portal
Publication:868556
DOI10.1007/s10957-006-9108-6zbMath1152.90565OpenAlexW2128637980MaRDI QIDQ868556
Publication date: 6 March 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9108-6
Related Items (19)
Characterization of weakly sharp solutions of a variational inequality by its primal gap function ⋮ Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ On characterizing solution set of non-differentiable η-pseudolinear extremum problem ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ A note on characterizing solution set of nonsmooth pseudoinvex optimization problem ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Characterizations of the solution set for a class of nonsmooth optimization problems ⋮ Unnamed Item ⋮ The convexity of the solution set of a pseudoconvex inequality ⋮ Studniarski's derivatives and efficiency conditions for constrained vector equilibrium problems with applications ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterization of solution sets of convex optimization problems in Riemannian manifolds ⋮ On characterizing the solution sets of pseudoinvex extremum problems ⋮ Optimality conditions for the efficient solutions of vector equilibrium problems with constraints in terms of directional derivatives and applications ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A simple characterization of solutions sets of convex programs
- Monotone (nonlinear) operators in Hilbert space
- Convex functions, monotone operators and differentiability
- Infinite-dimensional convex programming with applications to constrained approximation
- A class of gap functions for variational inequalities
- Convex analysis and nonlinear optimization. Theory and examples
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- An analytic center cutting plane method for solving semi-infinite variational inequality problems
- On characterizing the solution sets of pseudolinear programs
- Gâteaux differentiability of the dual gap function of a variational inequality
- Characterization of solution sets of convex programs
- Optimization and nonsmooth analysis
- Weak Sharp Solutions of Variational Inequalities
- Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces
- Convex Analysis
This page was built for publication: Characterizations of the solution sets of convex programs and variational inequality problems
