An approach to characterizing -solution sets of convex programs
In this paper, we propose an approach to characterizing ϵ ϵ-solution sets of convex
programs with a given ϵ> 0 ϵ> 0. The results are divided into two parts. The first one is …
programs with a given ϵ> 0 ϵ> 0. The results are divided into two parts. The first one is …
[PDF][PDF] -Optimal Solutions in Nonconvex Semi-Infinite Programs with Support Functions
DS Kim, TQ Son - Fixed Point Theory and Applications, 2011 - Springer
Approximate optimality conditions for a class of nonconvex semi-infinite programs involving
support functions are given. The objective function and the constraint functions are locally …
support functions are given. The objective function and the constraint functions are locally …
[PDF][PDF] Refinements of -Duality theorems for a Nonconvex Problem with an Infinite Number of Constraints
TQ Son - Journal of Nonlinear Analysis and Optimization: Theory …, 2013 - ph03.tci-thaijo.org
Refinements of $\varepsilon $-Duality theorems for a Nonconvex Problem with an Infinite
Number of Constraints Page 63 Journal of Nonlinear Analysis and Optimization Vol. 4, No. 2,(2013) …
Number of Constraints Page 63 Journal of Nonlinear Analysis and Optimization Vol. 4, No. 2,(2013) …
[epsilon]-Optimal Solutions in Nonconvex Semi-Infinite Programs with Support Functions
TQ Son - Fixed Point Theory and Algorithms for Sciences …, 2011 - search.proquest.com
Approximate optimality conditions for a class of nonconvex semi-infinite programs involving
support functions are given. The objective function and the constraint functions are locally …
support functions are given. The objective function and the constraint functions are locally …