Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (Q6064032): Difference between revisions

Latest revision as of 18:06, 30 December 2024

scientific article; zbMATH DE number 7762766

Language	Label	Description	Also known as
English	Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials	scientific article; zbMATH DE number 7762766

Statements

instance of

scholarly article

0 references

title

Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (English)

0 references

0 references

0 references

0 references

Journal of Global Optimization

0 references

publication date

8 November 2023

0 references

zbMATH Keywords

nonconvex uncertain semi-infinite programming

0 references

tangential subdifferential

0 references

robust optimal solution set

0 references

Dini pseudoconvexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-022-01134-2

0 references

cites work

Robust optimization-methodology and applications

0 references

Q3182207

0 references

Duality in robust optimization: Primal worst equals dual best

0 references

Robust duality in parametric convex optimization

0 references

Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs

0 references

Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints

0 references

ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

0 references

On \(\epsilon\)-solutions for convex optimization problems with uncertainty data

0 references

Characterizations of robust<i>ε</i>-quasi optimal solutions for nonsmooth optimization problems with uncertain data

0 references

Some characterizations of approximate solutions for robust semi-infinite optimization problems

0 references

On approximate efficiency for nonsmooth robust vector optimization problems

0 references

A simple characterization of solutions sets of convex programs

0 references

Characterization of solution sets of convex programs

0 references

Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs

0 references

Characterizations of solution sets of differentiable quasiconvex programming problems

0 references

Characterization of solution sets of quasiconvex programs

0 references

On characterizing the solution sets of pseudolinear programs

0 references

Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems

0 references

On characterizing the solution sets of pseudoinvex extremum problems

0 references

Characterizations of the solution set for a class of nonsmooth optimization problems

0 references

A new approach to characterize the solution set of a pseudoconvex programming problem

0 references

Q2953986

0 references

Q3106488

0 references

Characterizing robust solution sets of convex programs under data uncertainty

0 references

Characterizations of robust solution set of convex programs with uncertain data

0 references

Some characterizations of robust optimal solutions for uncertain convex optimization problems

0 references

Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems

0 references

Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints

0 references

Q5613725

0 references

Robustness in nonsmooth nonconvex optimization problems

0 references

Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials

0 references

Optimization and nonsmooth analysis

0 references

Characterizing the solution set of convex optimization problems without convexity of constraints

0 references

Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints

0 references

On constraint qualifications in directionally differentiable multiobjective optimization problems

0 references

Convex Analysis

0 references

Q3318471

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10898-022-01134-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6064032

@@ Property / DOI @@
-.1007/s10898-022-01134-2
@@ Property / DOI: 10.1007/s10898-022-01134-2 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10898-022-01134-2
@@ Property / DOI: 10.1007/S10898-022-01134-2 / rank @@
+Normal rank