\(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
type: Item
instance of: scholarly article
title: \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
zbMATH Open document ID: 1184.49036
DOI: 10.1155/2010/363012
author: Gue Myung Lee
author: Jae Hyoung Lee
published in: Journal of Inequalities and Applications
publication date: 2010-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/227607
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5689909
zbMATH Keywords: convex semidefinite optimization problem
zbMATH Keywords: Wolfe-type dual problem
zbMATH Keywords: \(\varepsilon\)-approximate solutions
zbMATH Keywords: \(\varepsilon\)-weak duality theorem
zbMATH Keywords: \(\varepsilon \)-strong duality theorem
MaRDI profile type: Publication
OpenAlex ID: W2085364069
Wikidata QID: Q59251530
cites work: Strong Duality for Semidefinite Programming
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Q4524522
cites work: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
cites work: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
cites work: Characterizations of solution sets of convex vector minimization problems
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: Characterizing global optimality for DC optimization problems under convex inequality constraints
cites work: On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
cites work: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
cites work: \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions
cites work: Q3141900
cites work: Q4273942
description: scientific article; zbMATH DE number 5689909