Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
From MaRDI portal
Publication:368600
DOI10.1007/s10957-012-0243-yzbMath1272.90051OpenAlexW2063945453MaRDI QIDQ368600
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
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)
Related Items
Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Unnamed Item ⋮ Characterizations of efficient and weakly efficient points in nonconvex vector optimization ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterization of radially lower semicontinuous pseudoconvex functions ⋮ Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization and variational inequalities with pseudoconvex functions
- Convex composite multi-objective nonsmooth programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Characterizations of the solution sets of convex programs and variational inequality problems
- The convexity of the solution set of a pseudoconvex inequality
- A simple characterization of solutions sets of convex programs
- Complementarity problems over cones with monotone and pseudomonotone maps
- Infinite-dimensional convex programming with applications to constrained approximation
- Characterization of solution sets of quasiconvex programs
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear 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
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Weak Sharp Solutions of Variational Inequalities
