Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
type: Item
instance of: scholarly article
title: Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
zbMATH Open document ID: 1414.90257
author: Liguo Jiao
author: Jae Hyoung Lee
published in: Journal of Optimization Theory and Applications
publication date: 2018-03-22T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6852048
zbMATH Keywords: robust convex semidefinite programming problems
zbMATH Keywords: quasi approximate solutions
zbMATH Keywords: robust characteristic cone constraint qualification
zbMATH Keywords: approximate optimality conditions
zbMATH Keywords: approximate duality theorems
MaRDI profile type: Publication
full work available at URL: s10957-017-1199-8
OpenAlex ID: W2768812638
cites work: Robust convex quadratically constrained programs
cites work: Semidefinite programming
cites work: Semidefinite Programming
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: Robust linear optimization under general norms.
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
cites work: Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
cites work: Strong duality in robust semi-definite linear programming under data uncertainty
cites work: Necessary conditions for ε-optimality
cites work: On the variational principle
cites work: Approximate KKT points and a proximity measure for termination
cites work: Existence and optimality conditions for approximate solutions to vector optimization problems
cites work: On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
cites work: On quasi \(\epsilon\)-solution for robust convex optimization problems
cites work: \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
cites work: \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
cites work: Asymptotic dual conditions characterizing optimality for infinite convex programs
cites work: Strong Duality in Robust Convex Programming: Complete Characterizations
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
cites work: Q3182207
cites work: Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
cites work: From the Farkas Lemma to the Hahn--Banach Theorem
cites work: Necessary optimality conditions and saddle points for approximate optimization in Banach space
DOI: 10.1007/S10957-017-1199-8
Recommended article: On approximate solutions for robust convex semidefinite optimization problems
Recommended article: Q5143766
Recommended article: Q4817262
Recommended article: Q5116062
Recommended article: On quasi \(\epsilon\)-solution for robust convex optimization problems
Recommended article: Q5052072
Recommended article: On approximate solutions and saddle point theorems for robust convex optimization
Recommended article: Some characterizations of approximate solutions for robust semi-infinite optimization problems
Recommended article: Q5209919
Recommended article: Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
description: scientific article; zbMATH DE number 6852048