An UV-algorithm for semi-infinite multiobjective programming
From MaRDI portal
Publication:2504100
Recommendations
- Semi-infinite multiobjective programming with generalized invexity
- scientific article; zbMATH DE number 7400725
- Optimality with semilocally convex for multiobjective semi-infinite programming
- Optimality conditions for a class of multiobjective semi-infinite programming problems
- Multiobjective semi-infinite optimization: convexification and properly efficient points
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- On nonsmooth multiobjective semi-infinite programming problems with mixed constraints
- The optimality conditions for multiobjective semi-infinite programming involving generalized unified (C,, ,d)-convexity
- Multiobjective programming with semilocally convex functions
- scientific article; zbMATH DE number 5951952
Cited in
(4)- A filter trust region method for solving semi-infinite programming problems
- A superlinear \(\mathcal{VU}\) space-decomposition algorithm for semi-infinite constrained programming
- scientific article; zbMATH DE number 5630417 (Why is no real title available?)
- scientific article; zbMATH DE number 7400725 (Why is no real title available?)
This page was built for publication: An \({\mathcal{UV}}\)-algorithm for semi-infinite multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2504100)