Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
From MaRDI portal
Publication:6189397
Authors: Zhang Wen, Geng-Hua Li 
Publication date: 8 February 2024
Full work available at URL: https://applmath.cjoe.ac.cn/jweb_yysxxb/EN/Y2023/V46/I4/532
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
approximate solutiondualitysemi-infinite multiobjective optimizationtangential subdifferentials\(\varepsilon\)-quasi-saddle point
Multi-objective and goal programming (90C29) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Cites Work
- Optimization and nonsmooth analysis
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Title not available (Why is that?)
- Approximate convexity in vector optimisation
- How to solve a semi-infinite optimization problem
- Title not available (Why is that?)
- Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Lagrange saddle point criteria for nonsmooth semi-infinite multiobjective optimization problems
- Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Title not available (Why is that?)
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
Cited In (3)
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of 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)
