Refinements of -duality theorems for a nonconvex problem with an infinite number of constraints

MaRDI QIDQ4553758zbMATH OpenFDO

Authors T. Q. Son

Publication date 31 October 2018

Full work available at URL http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/252

zbMATH Keywords

\(\varepsilon\)-duality theorems\(\varepsilon\)-quasi solutionsalmost \(\varepsilon\)-quasi solutions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Recommendations

• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Publication:3481503
• Duality theorems of a nonconvex program with infinite constraints
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems

Cites work

• scientific article; zbMATH DE number 3662118 (Why is no real title available?)
• scientific article; zbMATH DE number 3378720 (Why is no real title available?)
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• Approximate duality
• Necessary conditions for ε-optimality
• Necessary optimality conditions and saddle points for approximate optimization in Banach space
• Optimization and nonsmooth analysis
• Semismooth and Semiconvex Functions in Constrained Optimization
• -optimal solutions in nonconvex semi-infinite programs with support functions
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
• ε-Optimal solutions in nondifferentiable convex programming and some related questions

Cited in

(7)

• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
• Duality theorems of a nonconvex program with infinite constraints
• Approximate optimality conditions and mixed type duality for a class of non-convex optimization problems
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• An approach to characterizing \(\epsilon\)-solution sets of convex programs
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems

This page was built for publication: Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints

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