Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
DOI10.1007/S10957-012-0243-YzbMATH Open1272.90051OpenAlexW2063945453MaRDI QIDQ368600FDOQ368600
Authors: V. Ivanov 
Publication date: 23 September 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0243-y
Recommendations
- scientific article; zbMATH DE number 2027845
- Optimization and variational inequalities with pseudoconvex functions
- The convexity of the solution set of a pseudoconvex inequality
- On characterization of solution sets of set-valued pseudoinvex optimization problems
- scientific article; zbMATH DE number 6500667
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Complementarity problems over cones with monotone and pseudomonotone maps
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Title not available (Why is that?)
- Optimization and variational inequalities with pseudoconvex functions
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Weak Sharp Solutions of Variational Inequalities
- Title not available (Why is that?)
- Characterizations of the solution sets of convex programs and variational inequality problems
- Title not available (Why is that?)
- A simple characterization of solutions sets of convex programs
- On characterizing the solution sets of pseudolinear programs
- Convex composite multi-objective nonsmooth programming
- Infinite-dimensional convex programming with applications to constrained approximation
- Characterization of solution sets of quasiconvex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- An extension of pseudolinear functions and variational inequality problems
- Second-order optimality conditions for problems with \(C^{1}\) data
- Characterization of solution sets of convex programs
- Higher-order pseudoconvex functions
- Characterization of the solution sets of pseudolinear programs and pseudoaffine variational inequality problems
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Title not available (Why is that?)
- The convexity of the solution set of a pseudoconvex inequality
Cited In (12)
- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- Title not available (Why is that?)
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of the solution set for non-essentially quasiconvex programming
- Title not available (Why is that?)
- Characterization of radially lower semicontinuous pseudoconvex functions
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions and constraint qualifications for quasiconvex programming
- The convexity of the solution set of a pseudoconvex inequality
This page was built for publication: Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368600)
