On approximate solutions for robust convex semidefinite optimization problems
type: Item
instance of: scholarly article
title: On approximate solutions for robust convex semidefinite optimization problems
zbMATH Open document ID: 1394.90459
author: Jae Hyoung Lee
author: Gue Myung Lee
published in: Positivity
publication date: 2018-09-05T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6932300
zbMATH Keywords: robust semidefinite optimization problem
zbMATH Keywords: \(\epsilon \)-solution
zbMATH Keywords: robust optimization approach
zbMATH Keywords: \(\epsilon \)-optimality conditions
zbMATH Keywords: \(\epsilon \)-duality theorems
MaRDI profile type: Publication
full work available at URL: s11117-017-0549-y
OpenAlex ID: W2775599896
cites work: Q4517101
cites work: Q3182207
cites work: Robust linear optimization under general norms.
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Robust convex quadratically constrained programs
cites work: \(\varepsilon\)-optimality for multiobjective programming on a Banach space
cites work: Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
cites work: An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
cites work: Q3141900
cites work: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
cites work: Characterizations of solution sets of convex vector minimization problems
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Strong duality in robust semi-definite linear programming under data uncertainty
cites work: On quasi \(\epsilon\)-solution for robust convex optimization problems
cites work: \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
cites work: On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
cites work: On \(\epsilon\)-solutions for robust fractional optimization problems
cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
cites work: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
cites work: \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
cites work: Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: Epsilon approximate solutions for multiobjective programming problems
DOI: 10.1007/S11117-017-0549-Y
description: scientific article; zbMATH DE number 6932300