Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
From MaRDI portal
Publication:5222253
Recommendations
- Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- Optimality conditions for nondifferentiable multiobjective semi-infinite programming problems
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 5150864 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 2069406 (Why is no real title available?)
- scientific article; zbMATH DE number 1779286 (Why is no real title available?)
- scientific article; zbMATH DE number 2123492 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A duality theorem for non-linear programming
- A generalized derivative for calm and stable functions
- An introduction to the theory of nonsmooth optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Constraint qualifications for KKT optimality condition in convex optimization with locally Lipschitz inequality constraints
- Constraint qualifications in convex vector semi-infinite optimization
- Dini derivatives in optimization — Part I
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Nonsmooth semi-infinite multiobjective optimization problems
- Nonsmooth vector functions and continuous optimization
- On convex optimization without convex representation
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- On the multiplier rules
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Optimality conditions for directionally differentiable multi-objective programming problems
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality conditions in convex multiobjective SIP
- Optimality conditions in convex optimization revisited
- Optimization and nonsmooth analysis
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Set-valued analysis
- Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming
- Sufficient conditions for extremum, penalty functions and regularity
Cited in
(22)- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Robustness in nonsmooth nonconvex optimization problems
- Robust optimality conditions for semi-infinite equilibrium problems involving data uncertainty
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
- Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Approximate quasi-efficient solutions of nonsmooth multiobjective semi-infinite programming problems in terms of tangential subdifferentials
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
- On multiobjective bilevel optimization using tangential subdifferentials
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- 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
- scientific article; zbMATH DE number 7547172 (Why is no real title available?)
This page was built for publication: Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222253)
