\(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints

DOI10.1155/2010/363012zbMath1184.49036OpenAlexW2085364069WikidataQ59251530 ScholiaQ59251530MaRDI QIDQ962489

Gue Myung Lee, Jae Hyoung Lee

Publication date: 7 April 2010

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227607

zbMATH Keywords

\(\varepsilon \)-strong duality theorem\(\varepsilon\)-approximate solutions\(\varepsilon\)-weak duality theoremconvex semidefinite optimization problemWolfe-type dual problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Duality theory (optimization) (49N15)

Related Items (3)

On approximate solutions for robust convex semidefinite optimization problems ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• \(\varepsilon\)-optimality for multiobjective programming on a Banach space
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• Characterizing global optimality for DC optimization problems under convex inequality constraints
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• Characterizations of solution sets of convex vector minimization problems
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• Strong Duality for Semidefinite Programming
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs

This page was built for publication: \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints