On -approximate solutions for convex semidefinite optimization problems

DOI10.11650/TWJM/1500404757MaRDI QIDQ2377463zbMATH OpenOpenAlexFDO

Authors Gwi Soo Kim, Gue Myung Lee

Publication date 29 April 2008

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11650/twjm/1500404757

zbMATH Keywords

\(\varepsilon\)-optimality conditions\(\varepsilon\)-saddle point theorem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
• On approximate solutions for robust convex semidefinite optimization problems
• On \(\epsilon\)-solutions for semidefinite linear fractional optimization problems
• Optimality conditions and duality theorems for -quasi weakly efficient solutions in semi-convex multi-objective optimization problems
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs

Cited in

(7)

• On -optimality conditions for multiobjective fractional optimization problems
• Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
• On \(\epsilon\)-solutions for semidefinite linear fractional optimization problems
• On the optimality conditions for D.C. vector optimization problems
• Equivalence of \(\varepsilon\)-approximate separation and optimization in fixed dimensions.
• Finite -subgradient algorithm for approximate solution of the parametric programming problem
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints

This page was built for publication: On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377463)