-duality theorems for convex semidefinite optimization problems with conic constraints

DOI10.1155/2010/363012MaRDI QIDQ962489zbMATH OpenOpenAlexWikidataFDO

Authors Gue Myung Lee, Jae Hyoung Lee

Publication date 7 April 2010

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
• Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
• On approximate solutions for robust convex semidefinite optimization problems
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• On \(\epsilon\)-solutions for semidefinite linear fractional optimization problems

Cites work

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

Cited in

(4)

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

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

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