On characterizing the solution sets of pseudoinvex extremum problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6500667
- On characterization of solution sets of set-valued pseudoinvex optimization problems
- Characterizations of solution sets of set-valued generalized pseudoinvex optimization problems
- Characterizations of the solution sets of pseudoinvex programs and variational inequalities
- Extensions in invexity theory
Cites work
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of convex programs
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of the solution sets of convex programs and variational inequality problems
- Convex composite multi-objective nonsmooth programming
- Generalized invexity and generalized invariant monotonicity
- Infinite-dimensional convex programming with applications to constrained approximation
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- On invex sets and preinvex functions
- Pre-invex functions in multiple objective optimization
Cited in
(29)- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Characterizations of solution sets of set-valued generalized pseudoinvex optimization problems
- A reduced formulation for pseudoinvex vector functions
- On characterization of solution sets of set-valued pseudoinvex optimization problems
- Characterizing the solution set of convex optimization problems without convexity of constraints
- scientific article; zbMATH DE number 6500667 (Why is no real title available?)
- Invariant pseudolinearity with applications
- Characterizing robust -optimal solution sets for uncertain convex optimization problems
- Generalized pseudolinearity
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of robust solution set of convex programs with uncertain data
- A characterization of the solution set of pseudoconvex extremum problems
- On characterizing solution set of non-differentiable -pseudolinear extremum problem
- Characterizations of the solution sets of pseudoinvex programs and variational inequalities
- Higher order invex functions and higher order pseudoinvex ones
- Characterizations of the solution set for non-essentially quasiconvex programming
- Characterizations of the solution sets of generalized convex fuzzy optimization problem
- Characterizations of solution sets of nonsmooth mathematical programming problems
- 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
- Optimality conditions and constraint qualifications for quasiconvex programming
- The convexity of the solution set of a pseudoconvex inequality
- A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
- Characterizations of the solution set for a class of nonsmooth optimization problems
- A new approach to characterize the solution set of a pseudoconvex programming problem
This page was built for publication: On characterizing the solution sets of pseudoinvex extremum problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016423)
