Refinements of -duality theorems for a nonconvex problem with an infinite number of constraints
zbMATH Open1413.90220MaRDI QIDQ4553758FDOQ4553758
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
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
\(\varepsilon\)-duality theorems\(\varepsilon\)-quasi solutionsalmost \(\varepsilon\)-quasi solutions
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Duality theory (optimization) (49N15)
Cites Work
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Title not available (Why is that?)
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Title not available (Why is that?)
- Necessary conditions for ε-optimality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions
- Approximate duality
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
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- 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)
