Necessary and sufficient conditions for efficiency via convexificators (Q2251552): Difference between revisions

The author considers necessary conditions for a weak Pareto minimum of multi-objective programming problems with inequality, equality, and set constraints. The necessary conditions in terms of convexificators are established, and shown to be sufficient in the case of general convexity.

0 references

zbMATH Keywords

necessary and sufficient conditions for weak Pareto minimum

0 references

upper and lower convexificators

0 references

upper regular convexificators

0 references

quasiconvex functions

0 references

reviewed by

Antanas Žilinskas

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-013-0377-6

0 references

cites work

Continuous generalized convex functions and their characterizations

0 references

Hunting for a smaller convex subdifferential

0 references

Q4875353

0 references

Nonsmooth calculus, minimality, and monotonicity of convexificators

0 references

Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C<sup>1</sup>-Optimization

0 references

Q4216243

0 references

A Multiplier Rule for Multiobjective Programming Problems with Continuous Data

0 references

Convexifactors, generalized convexity and vector optimization

0 references

Convexifactors, generalized convexity, and optimality conditions

0 references

Convexificators and necessary conditions for efficiency

0 references

Optimality conditions for optimistic bilevel programming problem using convexifactors

0 references

Optimality and duality results for bilevel programming problem using convexifactors

0 references

Optimization and nonsmooth analysis

0 references

Q3683072

0 references

Q4856868

0 references

A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization

0 references

0 references

0 references

0 references

0 references

Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials

0 references

Identifiers

zbMATH Open document ID

1314.90075

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S10957-013-0377-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2251552

@@ Property / DOI @@
-.1007/s10957-013-0377-6
@@ Property / DOI: 10.1007/s10957-013-0377-6 / rank @@
-Normal rank
@@ Property / reviewed by @@
-Antanas Žilinskas
@@ Property / reviewed by: Antanas Žilinskas / rank @@
-Normal rank
@@ Property / reviewed by @@
+Antanas Žilinskas
@@ Property / reviewed by: Antanas Žilinskas / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10957-013-0377-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1982522297
@@ Property / OpenAlex ID: W1982522297 / rank @@
+Normal rank
@@ Property / cites work @@
+Continuous generalized convex functions and their characterizations
+Normal rank
@@ Property / cites work @@
+Hunting for a smaller convex subdifferential
@@ Property / cites work: Hunting for a smaller convex subdifferential / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875353
@@ Property / cites work: Q4875353 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonsmooth calculus, minimality, and monotonicity of convexificators
+Normal rank
@@ Property / cites work @@
+Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C<sup>1</sup>-Optimization
+Normal rank
@@ Property / cites work @@
+Q4216243
@@ Property / cites work: Q4216243 / rank @@
+Normal rank
@@ Property / cites work @@
+A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
+Normal rank
@@ Property / cites work @@
+Convexifactors, generalized convexity and vector optimization
+Normal rank
@@ Property / cites work @@
+Convexifactors, generalized convexity, and optimality conditions
+Normal rank
@@ Property / cites work @@
+Convexificators and necessary conditions for efficiency
+Normal rank
@@ Property / cites work @@
+Optimality conditions for optimistic bilevel programming problem using convexifactors
+Normal rank
@@ Property / cites work @@
+Optimality and duality results for bilevel programming problem using convexifactors
+Normal rank
@@ Property / cites work @@
+Optimization and nonsmooth analysis
@@ Property / cites work: Optimization and nonsmooth analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q3683072
@@ Property / cites work: Q3683072 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856868
@@ Property / cites work: Q4856868 / rank @@
+Normal rank
@@ Property / cites work @@
+A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
+Normal rank
@@ Property / cites work @@
+Q5589748
@@ Property / cites work: Q5589748 / rank @@
+Normal rank
@@ Property / cites work @@
+Set-valued analysis
@@ Property / cites work: Set-valued analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q3324260
@@ Property / cites work: Q3324260 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials
+Normal rank
@@ Property / DOI @@
+.1007/S10957-013-0377-6
@@ Property / DOI: 10.1007/S10957-013-0377-6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2251552