Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
From MaRDI portal
(Redirected from Publication:368600)
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
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- scientific article; zbMATH DE number 2120969 (Why is no real title available?)
- A simple characterization of solutions sets of convex programs
- An extension of pseudolinear functions and variational inequality problems
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterization of the solution sets of pseudolinear programs and pseudoaffine variational inequality problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Characterizations of the solution sets of convex programs and variational inequality problems
- Complementarity problems over cones with monotone and pseudomonotone maps
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Convex composite multi-objective nonsmooth programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Higher-order pseudoconvex functions
- Infinite-dimensional convex programming with applications to constrained approximation
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- Optimization and variational inequalities with pseudoconvex functions
- Second-order optimality conditions for problems with \(C^{1}\) data
- The convexity of the solution set of a pseudoconvex inequality
- Weak Sharp Solutions of Variational Inequalities
Cited in
(12)- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- scientific article; zbMATH DE number 7669915 (Why is no real title available?)
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- Characterizations of the solution set for non-essentially quasiconvex programming
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- 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)
