On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11117-012-0186-4 / rank
Normal rank
 
Property / author
 
Property / author: Gue Myung Lee / rank
Normal rank
 
Property / author
 
Property / author: Gue Myung Lee / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C46 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6563972 / rank
 
Normal rank
Property / zbMATH Keywords
 
robust convex optimization problem
Property / zbMATH Keywords: robust convex optimization problem / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\varepsilon\)-solution
Property / zbMATH Keywords: \(\varepsilon\)-solution / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization approach
Property / zbMATH Keywords: robust optimization approach / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\varepsilon\)-optimality conditions
Property / zbMATH Keywords: \(\varepsilon\)-optimality conditions / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\varepsilon\)-duality theorems
Property / zbMATH Keywords: \(\varepsilon\)-duality theorems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11117-012-0186-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974461824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics in robust convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon approximate solutions for multiobjective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\varepsilon\)-optimality for multiobjective programming on a Banach space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in robust optimization: Primal worst equals dual best / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Uncertainty Sets for Robust Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear optimization under general norms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic dual conditions characterizing optimality for infinite convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Robust Convex Programming: Complete Characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of solution sets of convex vector minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11117-012-0186-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:02, 9 December 2024

scientific article
Language Label Description Also known as
English
On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
scientific article

    Statements

    On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2016
    0 references
    robust convex optimization problem
    0 references
    \(\varepsilon\)-solution
    0 references
    robust optimization approach
    0 references
    \(\varepsilon\)-optimality conditions
    0 references
    \(\varepsilon\)-duality theorems
    0 references
    0 references
    0 references

    Identifiers