Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
From MaRDI portal
Publication:6189397
Recommendations
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Duality for nonsmooth semi-infinite multiobjective optimization problems
- Approximate quasi-efficient solutions of nonsmooth multiobjective semi-infinite programming problems in terms of tangential subdifferentials
- Approximate proper efficiencies in nonsmooth semi-infinite multiobjective optimization problems
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
Cites work
- scientific article; zbMATH DE number 5951407 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 3336546 (Why is no real title available?)
- Approximate convexity in vector optimisation
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- How to solve a semi-infinite optimization problem
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Lagrange saddle point criteria for nonsmooth semi-infinite multiobjective optimization problems
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimization and nonsmooth analysis
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems
- Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
Cited in
(3)- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
This page was built for publication: Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6189397)
