On characterizing the solution sets of pseudoinvex extremum problems
From MaRDI portal
Publication:1016423
DOI10.1007/s10957-008-9470-7zbMath1189.90163OpenAlexW1998605937MaRDI QIDQ1016423
Publication date: 5 May 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9470-7
Related Items (20)
Characterizations of robust solution set of convex programs with uncertain data ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ 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 ⋮ Invariant pseudolinearity with applications ⋮ On characterization of solution sets of set-valued pseudoinvex optimization problems ⋮ Generalized pseudolinearity ⋮ Characterizations of efficient and weakly efficient points in nonconvex vector optimization ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems ⋮ Higher order invex functions and higher order pseudoinvex ones ⋮ Characterizations of the solution sets of generalized convex fuzzy optimization problem ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ 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
- Convex composite multi-objective nonsmooth programming
- Characterizations of the solution sets of convex programs and variational inequality problems
- A simple characterization of solutions sets of convex programs
- Pre-invex functions in multiple objective optimization
- Infinite-dimensional convex programming with applications to constrained approximation
- Generalized invexity and generalized invariant monotonicity
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On invex sets and preinvex functions
- On characterizing the solution sets of pseudolinear programs
- Characterizations of solution sets of convex vector minimization problems
- Characterization of solution sets of convex programs
This page was built for publication: On characterizing the solution sets of pseudoinvex extremum problems
