References
- Bertsekas , D.P. 1976 . Nondifferentiable optimization viaapproximation . Math.Prog , 3 : 1 – 25 .
- Glover , B.M. , Rubinov , A.M. and Craven , B.D. 1995 . Solvability theorems involving inf-convexfunctions . Journal of Math. Anal. Appl , 191 : 303 – 330 .
- Goh , C.J. and Yang , X.Q. 1997 . A sufficient and necessary condition fornon-convex constrained optimization . Applied Mathematics Letters , 10 : 9 – 12 .
- Goh , C.J. and Yang , X.Q. 1996 . “ A nonlinear Lagrangian theory for nonconvexoptimization problems, Preprint, the University ofWestern Australia ” . Australia
- Grossman , Ch. and Kaplan , A. 1979 . “ Teubner Texte zur Mathematik ” . In Strajiunktionen und Modgzierte Lagrange-funktionen in der Nichtlinearen Optimierund Leipzing
- Jeyakumar , V. and Wolkowicz , H. 1990 . Zero duality gaps in infinite-dimensional programming . Journal of Optimization Theory and Applications , 67 : 87 – 108 .
- Li , D. 1995 . Zero duality gap for a class of nonconvexoptimization problems . Journal of Optimization Theory and Applications , 85 ( 2 ) : 309 – 324 .
- Rockafellar , R.T. 1974 . “ CBMS Lecture Notes Series ” . In Conjugate Duality and Optimization , 162 Pennsylvania : SIAM Publications .
- Rockafellar , R.T. 1993 . Lagrange multipliers and optimality . SIAM Review , 35 : 183 – 238 .
- Rubinov A.M. Glover B.M. Increasing convex-along-rays functions with applications to global minimization SITMS, Univer-sity of Ballarat 1996 Research Report 21/96
- Glover , B.M. 1998 . Duality for increasing positively ho-mogeneous functions and normal sets . RAIRO Operations Research , 32 : 105 – 123 .
- Rubinov A. M. Glover B. M. Yang X. Q.. Decreasing functions withapplications to penalization SIAM Journal Optimization to appear
- Thach , R.T. 1993 . Global optimality criterion and a duality with zero gap in nonconvex optimization . SIAM J.Math.Ana , 24 : 1537 – 1556 .
- Yevtushenko , Yu.G. and Zhadan , V.G. 1990 . Exact auxiliary functions in opti-mization problems . U.S.S.R.Comput.Maths.Mirth.Phys , 30 : 31 – 42 .
- Zabotin , Ya.I. 1975 . A minimax method for solving problems of mathematical programming . Soviet Mathematics(Iz VUZ) , 19 : 28 – 33 .