Nonlinear optimization

Nonlinear Optimization

Volumn , Issue , 2011, Pages

  Ruszczynski, Andrzej ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84861615338     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (173)

1. F. Alizadeh, J.-P. A. Haeberly, and M. L. Overton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM Journal on Optimization 8 (1998), 746-768.
2. A. Altman and J. Gondzio, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization, Optimization Methods and Software 11 (1999), 275-302.
3. S. R. Arridge and J. C. Hebden, Optical imaging in medicine. 2. Modelling and reconstruction, Physics in Medicine and Biology 42 (1997), 841-853.
4. K. J. Arrow and R. M. Solow, Gradient methods for constrained maxima with weakened assumptions, Studies in Linear and Non-Linear Programming (K. J. Arrow, L. Hurwicz, and H. Uzawa, eds.), Stanford University Press, Stanford, California, 1958.
5. J.-P. Aubin and I. Ekeland, Applied Nonlinear Analysis, Wiley, New York, 1984.
6. J.-P. Aubin and H. Frankowska, Set-Valued Analysis, Birkhäuser, Boston, 1990.
7. B. Bank, J. Guddat, D. Klatte, B. Kummer, and K. Tammer, Non-Linear Parametric Optimization, Akademie-Verlag, Berlin, 1982.
8. A. Ben-Israel, A Newton-Raphson method for the solution of systems of equations, Journal of Mathematical Analysis and Applications 15 (1966), 243-252.
9. D. P. Bertsekas, On the Goldstein-Levitin-Polyak gradient projection method, IEEE Transactions of Automatic Control 21 (1976), 174-184.
10. D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
11. J.-F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. Sagastizábal, Numerical Optimization. Theoretical and Practical Aspects, Springer-Verlag, Berlin, 2003.
12. J.-F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems, Springer-Verlag, New York, 2000.
13. G. Bouligand, Sur les surfaces dépourvues de points hyperlimites, Annales de la Société Polonaise de Mathématique 9 (1930), 32-41.
14. C. G. Broyden, The convergence of a class of of double rank minimization algorithms, Journal of the Institute for Mathematics and Applications 6 (1970), 222-231.
15. J. V. Burke and M. C. Ferris, A Gauss-Newton method for convex composite optimization, Mathematical Programming 71 (1995), 179-194.
16. J. D. Buys, Dual algorithms for constrained optimization, Ph.D. thesis, Rijksuniversiteit te Leiden, Leiden, The Netherlands, 1972.
17. C. W. Carroll, The rerated response surface technique for optimizing nonlinear restrained systems, Operations Research 9 (1961), 169-184.
18. A. Cauchy, Méthode générale pour la résolution des systèmes d'équations simultanées, Comptes Rendus de l'Académie des Sciences Paris, Série I 25 (1847), 536-538.
19. F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983.
20. F. H. Clarke, Methods of Dynamic and Nonsmooth Optimization, SIAM Publications, Philadelphia, 1989.
21. J.W. Daniel, The Approximate Minimization of Functionals, Prentice Hall, Englewood Cliffs, New Jersey, 1971.
22. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963.
23. G. B. Dantzig and M. N. Thapa, Linear Programming, Springer-Verlag, New York, 2003.
24. W. C. Davidon, Variable metric methods for minimization, AEC Research and Development Report ANL-5990, Argonne National Laboratory, Argonne, Illinois, 1959.
25. R. Dembo, R. Eisenstat, and T. Steinhaug, Inexact Newton methods, SIAM Journal on Numerical Analysis 19 (1982), 400-408.
26. R. Dembo and T. Steinhaug, Truncated Newton methods for large scale optimization, Mathematical Programming 26 (1983), 190-212.
27. J. E. Dennis, Jr and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice Hall, Englewood Cliffs, New Jersey, 1983.
28. D. Dentcheva and A. Ruszczyński, Optimization with stochastic dominance constraints, SIAM Journal on Optimization 14 (2003), 548-566.
29. F. Deutsch, Best Approximation in Inner Product Spaces, Springer-Verlag, New York, 2001.
30. L. C. W. Dixon, Quasi-Newton algorithms generate identical points. II. The proofs of four new theorems, Mathematical Programming 3 (1972), 345-358.
31. A. Y. Dubovitskii and A. A. Milyutin, Extremum problems in the presence of restrictions, U.S.S.R. Computational Mathematics and Mathematical Physics 5 (1965), 1-80 (Russian).
32. J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Mathematical Programming 55 (1992), 293-318.
33. I. Ekeland and R. Temam, Analyse Convexe et Problèmes Variationnelles, Dunod, Paris, 1971, English transl., North-Holland, Amsterdam, 1976.
34. I. I. Eremin, The penalty method in convex programming, Doklady Akademii Nauk SSSR 8 (1966), 459-462 (Russian).
35. Yu. M. Ermoliev, Methods for solving nonlinear extremal problems, Kibernetika (Kiev) 1 (1966), 1-17 (Russian).
36. Yu. M. Ermoliev, Stochastic Programming Methods, Nauka, Moscow, 1976 (Russian).
37. J. E. Falk, Lagrange multipliers and nonconvex programs, SIAMJournal on Control 7 (1969), 534-545.
38. J. Farkas, Theorie der einfachen Ungleichungen, Zeitschrift für Reine und Angewandte Mathematik 124 (1901), 1-27.
39. W. Fenchel, On conjugate convex functions, Canadian Journal of Mathematics 1 (1949), 73-77.
40. W. Fenchel, Convex Cones, Sets and Functions. Lecture Notes, Princeton University, Princeton, New Jersey, 1951.
41. A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, 1968.
42. R. Fletcher, A new approach to variable metric algorithms, Computer Journal 13 (1970), 317-322.
43. R. Fletcher, Practical Methods of Optimization, second ed.,Wiley, Chichester, 1987.
44. R. Fletcher and M. J. D. Powell, A rapidly convergent descent method for minimization, Computer Journal 6 (1963), 163-168.
45. R. Fletcher and C. M. Reeves, Function minimization by conjugate gradients, Computer Journal 7 (1964), 149-154.
46. A. Forsgren, P. E. Gill, and M. H. Wright, Interior methods for nonlinear optimization, SIAM Review 44 (2002), 525-597.
47. M. R. Frisch, La résolution des problèmes de programme linéaire par la méthode du potentiel logarithmique, Cahiers du Séminaire d'Econometrie 4 (1956), 7-20.
48. D. Gale, H. W. Kuhn, and A. W. Tucker, Linear programming and the theory of games, Activity Analysis of Production and Allocation (T. C. Koopmans, ed.), Wiley, New York, 1951.
49. U. M. Garcia-Palomares and O. L. Mangasarian, Superlinearly convergent quasi-Newton methods for nonlinearly constrained optimization problems, Mathematical Programming 11 (1976), 1-13.
50. J. Gilbert and C. Lemaréchal, Some numerical experiments with variable-storage quasi-Newton algorithms, Mathematical Programming, Series B 45 (1989), 407-435.
51. P. E. Gill, M. A. Murray, and M. A. Saunders, SNOPT: An SQP algorithm for large-scale constrained optimization, SIAM Journal on Optimization 12 (2002), 979-1006.
52. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, London, 1981.
53. J.-L. Goffin and J.-P. Vial, Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method, Optimization Methods and Software 17 (2002), 805-867.
54. D. Goldfarb, A family of variable-metric methods derived by variational means, Mathematics of Computation 24 (1970), 23-26.
55. A. A. Goldstein, Cauchy's method of minimization, Numerische Mathematik 4 (1962), 146-150.
56. A. A. Goldstein, Convex programming in Hilbert space, Bulletin of The American Mathematical Society 70 (1964), 709-710.
57. E. G. Golshtein, Duality Theory in Mathematical Programming, Nauka, Moscow, 1971 (Russian).
58. E. G. Golshtein and N. V. Tretyakov, Modified Lagrange Functions; Theory and Optimization Method, Nauka, Moscow, 1989 (Russian), English transl., Wiley, New York, 1996.
59. A. Griewank, Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation, SIAM Publications, Philadelphia, 2000.
60. W. A. Gruver and E. Sachs, Algorithmic Methods in Optimal Control, Research Notes in Mathematics, vol. 47, Pitman, Boston and London, 1981.
61. P. C. Haarhoff and J. D. Buys, A new method for the minimization of a nonlinear function subject to nonlinear constraints, Computer Journal 13 (1970), 178-184.
62. S. P. Han, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Mathematical Programming 11 (1976), 263-282.
63. C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, SIAM Journal on Optimization 10 (2000), 673-696.
64. R. Henrion and J. Outrata, A subdifferential condition for calmness of multifunctions, Journal of Mathematical Analysis and Applications 258 (2001), 110-130.
65. M. R. Hestenes, Multiplier and gradient methods, Journal of Optimization Theory and Applications 4 (1969), 303-320.
66. M. R. Hestenes, Conjugate Direction Methods in Optimization, Springer-Verlag, Berlin, 1980.
67. M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards 49 (1952), 409-436.
68. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
69. R. B. Holmes, A Course on Optimization and Best Approximation, Lecture Notes in Mathematics, vol. 257, Springer-Verlag, Berlin, 1972.
70. L. Hurwicz, Programming in linear spaces, Studies in Linear and Non-Linear Programming (K. J. Arrow, L. Hurwicz, and H. Uzawa, eds.), Stanford University Press, Stanford, California, 1958.
71. A. D. Ioffe and V. M. Tikhomirov, Theory of Extremal Problem, Nauka, Moscow, 1974 (Russian), English transl., North-Holland, Amsterdam, 1979.
72. L. V. Kantorovich, On an effective method of solution of extremal problems for a quadratic functional, Doklady Akademii Nauk SSSR 48 (1945), 483-487 (Russian).
73. L. V. Kantorovich, Functional analysis and applied mathematics, Uspekhi Matematicheskich Nauk 3 (1948), 89-185 (Russian).
74. S. Karlin, Mathematical Methods and Theory in Games, Programming and Economics, Pergamon Press, Oxford, 1959.
75. W. Karush, Minima of functions of several variables with inequalities as side conditions, Master's thesis, University of Chicago, Chicago, Illinois, 1939.
76. C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations, SIAM Publications, Philadelphia, 1995.
77. C. T. Kelley and E. W. Sachs, Truncated Newton methods for optimization with inaccurate functions and gradients, Nonlinear Analysis-Theory, Methods and Applications 24 (1995), 883-894.
78. J. E. Kelley, The cutting plane method for solving convex programs, Journal of SIAM 8 (1960), 703-712.
79. K. C. Kiwiel, An aggregate subgradient method for nonsmooth convex minimization, Mathematical Programming 27 (1983), 320-341.
80. K. C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics, vol. 1133, Springer-Verlag, Berlin, 1985.
81. K. C. Kiwiel, Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization, SIAM Journal on Optimization 6 (1996), 227-249.
82. D. Klatte and B. Kummer, Nonsmooth Equations in Optimization, Kluwer, Dordrecht, 2002.
83. M. G. Krein and A. A. Nudelman, The Markov Moment Problem and Extremal Problem, Nauka, Moscow, 1973 (Russian), English transl., American Mathematical Society, Providence, 1977.
84. A. Y. Kruger and B. S. Mordukhovich, Extremal points and the Euler equation in nonsmooth problems of optimization, Doklady Akademii Nauk BSSR (Bielorussian Academy of Sciences) 24 (1980), 684-687 (Russian).
85. H.W. Kuhn and A.W. Tucker, Nonlinear programming, Proceedings of the Second Berkeley Symposium on Mathematical Stitistics and Probability (J. Neyman, ed.), University of California Press, Berkeley, California, 1951, pp. 481-492.
86. S.Kurcyusz and J. Zowe, Regularity and stability for the mathematical programming problem in Banach spaces, Applied Mathematics and Computation 5 (1979), 49-62.
87. S. Lasdon, Optimization Theory for Large Systems, MacMillan, New York, 1970.
88. P.-J. Laurent, Approximation et Optimization, Hermann, Paris, 1972.
89. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, New Jersey, 1974.
90. C. Lemaréchal, Nonsmooth optimization and descent methods, Research Report 78-4, International Institute of Applied Systems Analysis, Laxenburg, Austria, 1978.
91. K. Levenberg, A method for the solution of certain nonlinear problems in least squares, Quarterly of Applied Mathematics 2 (1944), 164-168.
92. V. L. Levin, Convex Analysis in Spaces of Measurable Functions and Its Applications in Mathematics and Economics, Nauka, Moscow, 1985 (Russian).
93. C. Li and X. Wang, On convergence of the Gauss-Newton method for convex composite optimization, Mathematical Programming 91 (2002), 349-356.
94. D. C. Liu and J. Nocedal, On the limited memory BFGS method for large scale optimization, Mathematical Programming 45 (1989), 503-528.
95. D. G. Luenberger, Optimization by Vector Space Methods,Wiley, New York, 1974.
96. Z. Q. Luo, Applications of convex optimization in signal processing and digital communication, Mathematical Programming, Series B 97 (2003), 177-207.
97. O. L. Mangasarian, Support vector machine classification via parameterless robust linear programming, Optimization Methods and Software 20 (2005), 115-125.
98. O. L. Mangasarian and S. Fromovitz, The Fritz-John conditions in the presence of equality and inequality constraints, Journal of Mathematical Analysis and Applications 17 (1967), 73-74.
99. H. M. Markowitz, Mean-Variance Analysis in Portfolio Choice and Capital Markets, Blackwell, Oxford, 1987.
100. I. Maros, Computational Techniques of the Simplex Code, Kluwer, Dordrecht, 2002.
101. D. W. Marquardt, An algorithm for least-squares estimation of nonlinear parameters, Journal of SIAM 11 (1963), 431-441.
102. B. Martinet, Régularisation d'inéquations variationnelles par approximations successives, Revue Française Informatique et Recherche Opérationnelle, Ser. R-3 4 (1970), 154-158.
103. R. Miffl{ligature}in, A modification and an extension of Lemaréchal's algorithm for nonsmooth minimization, Nondifferential and Variational Techniques in Optimization (D. C. Sorensen and R. J. B. Wets, eds.), vol. 17, 1982, pp. 77-90.
104. V. S. Mikhalevich, A. M. Gupal, and V. I. Norkin, Nonconvex Optimization Methods, Nauka, Moscow, 1987 (Russian).
105. H. Minkowski, Geometrie der Zahlen, Teubner, Leipzig, 1896.
106. H. Minkowski, Theorie der konvexen Körper, insbesondere Begründung ihres Obenrfl{ligature}ächenbegriffs, Gesammelte Abhandlungen, II, Teubner, Leipzig, 1911.
107. B. S. Mordukhovich, Variational Analysis and Generalized Differentiation, Springer-Verlag, Berlin, 2005.
108. J. J. Moré, Recent development in algorithms and software for trust region methods, Mathematical Programming, the State of the Art (A. Bachem, M. Grötschel, and B. Korte, eds.), Springer-Verlag, Berlin, 1983, pp. 258-287.
109. J. J. Moreau, Fonctions convexes duales et points proximaux dans un espace Hilbertien, Comptes Rendus de l'Académie des Sciences Paris, Série I 255 (1962), 2897-2899.
110. J. J. Moreau, Propriétés des applications prox', Comptes Rendus de l'Académie des Sciences Paris, Série I 256 (1963), 1069-1071.
111. J. J. Moreau, Proximité et dualité dans un espace Hilbertien, Bulletin de la Société Mathématique de France 93 (1965), 273-299.
112. B. A. Murtagh and M. A. Saunders, Large-scale linearly constrained optimization, Mathematical Programming 44 (1978), 41-72.
113. S. G. Nash, Preconditioning of truncated Newton methods, SIAM Journal on Scientific Computing 6 (1985), 599-616.
114. G. L. Nemhauser and L. A.Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988.
115. Yu. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Publications, Philadelphia, 1994.
116. Yu. Nesterov and M. Todd, Primal-dual interior point methods for self-scaled cones, SIAM Journal on Optimization 8 (1998), 324-364.
117. J. Nocedal, Updating quasi-Newton matrices with limited storage, Mathematics of Computation 35 (1980), 773-782.
118. J. Nocedal and S. J. Wright, Numerical Optimization, Springer-Verlag, New York, 1997.
119. V. I. Norkin, Generalized Gradient Descent for Nonconvex Nonsmooth Optimization, PhD Dissertation, Institute of Cybernetics of the Ukrainian Academy of Sciences, Kiev, 1983 (Russian).
120. W. Ogryczak and A. Ruszczyński, Dual stochastic dominance and related mean-risk models, SIAM Journal on Optimization 13 (2002), 60-78.
121. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, London, 1970.
122. R. R. Phelps, Convex Functions, Monotone Operators, and Differentiability, Lecture Notes in in Mathematics, vol. 1364, Springer-Verlag, New York, 1989.
123. T. Pietrzykowski, An exact potential method for constrained maxima, SIAM Journal on Numerical Analysis 6 (1969), 299-304.
124. E. Polak and G. Ribière, Note sur la convergence de méthodes de directions conjuguées, Revue Francaise d'Informatique et de Recherche Opérationnelle 19 (1969), 35-43.
125. B. T. Polyak, A general method for solving extremal problems, Doklady Akademii Nauk SSSR 174 (1967), 33-36 (Russian).
126. B. T. Polyak, Minimization of nonsmooth functionals, U.S.S.R. Computational Mathematics and Mathematical Physics 9 (1969), 509-521.
127. M. J. D. Powell, An eficient method for finding the minimum of a function of several variables without calculating derivatives, Computer Journal 7 (1964), 155-162.
128. M. J. D. Powell, A method for nonlinear constraints in minimization problems, Optimization (R. Fletcher, ed.), Academic Press, London, 1969, pp. 283-298.
129. M. J. D. Powell, Convergence properties of a class of minimization algorithms, Nonlinear Programming (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds.), Academic Press, New York, 1975, pp. 1-27.
130. A. Prékopa, On the development of optimization theory, The American Mathematical Monthly 87 (1980), 527-542.
131. B. N. Pshenichnyi, Necessary Conditions for an Extremu, Nauka, Moscow, 1969 (Russian), English transl., Marcel Dekker, New York, 1971.
132. B. N. Pshenichnyi, Algorithms for the general problem of mathematical programming, Kibernetika (Kiev) 6 (1970), 120-125 (Russian).
133. B. N. Pshenichnyi, Convex Analysis and Extremal Problems, Nauka, Moscow, 1980 (Russian).
134. S. M. Robinson, Stability theory for systems of inequalitie, Part 1: Linear systems, SIAMJournal on Numerical Analysis 12 (1975), 754-768.
135. S. M. Robinson, Stability theory for systems of inequalitie, Part 2: Differentiable nonlinear systems, SIAM Journal on Numerical Analysis 13 (1976), 497-513.
136. S. M. Robinson, Generalized equations and their solution, Part 1: Basic theory, Mathematical Programming Study 10 (1979), 128-141.
137. S. M. Robinson, Generalized equations and their solution, Part 2: Applications to nonlinear programming, Mathematical Programming Study 19 (1982), 200-221.
138. S. M. Robinson, Local structure of feasible sets in nonlinear programming, Part I: Regularity, Numerical Methods (V. Pereira and A. Reinoza, eds.), Lecture Notes in in Mathematics, vol. 1005, Springer-Verlag, Berlin, 1983.
139. R. T. Rockafellar, Convex Functions and Dual Extremum Problems, PhD Dissertation, Harvard University, Cambridge, Massachusetts, 1963.
140. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
141. R. T. Rockafellar, Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM Journal on Control and Optimization 12 (1974), 268-285.
142. R. T. Rockafellar, Conjugate Duality and Optimization, SIAM Publications, Philadelphia, 1974.
143. R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976), 97-116.
144. R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM Journal on Control and Optimization 14 (1976), 877-898.
145. R. T. Rockafellar, Lagrange multipliers and optimality, SIAM Review 35 (1993), 183-238.
146. R. T. Rockafellar and R. J.-B. Wets, Variational Analysis, Springer-Verlag, Berlin, 1998.
147. C. Roos, T. Terlaky, and J.-P. Vial, Theory and Algorithms for Linear Optimization. An Interior Point Approach, Wiley, Chichester, 1997.
148. A. Ruszczyński, A regularized decomposition method for minimizing a sum of polyhedral functions, Mathematical Programming 35 (1986), 309-333.
149. A. Ruszczyński, On convergence of an augmented Lagrangian decomposition method for sparse convex optimization, Mathematics of Operations Research 20 (1995), 643-656.
150. A. Ruszczyński and A. Shapiro (eds.), Stochastic Programming, Elsevier, Amsterdam, 2003.
151. A. Ruszczyński and A. Shapiro, Optimization of convex risk functions, Research report, Optimization On-Line, 2004.
152. G. A. Schultz, R. B. Schnabel, and R. H. Byrd, A family of trustregion-based algorithms for unconstrained minimization with strong global convergence properties, SIAM Journal on Numerical Analysis 22 (1985), 47-67.
153. D. Shanno, Conditioning of quasi-Newton methods for function minimization, Mathematics of Computation 27 (1970), 647-656.
154. D. F. Shanno and R. J. Vanderbei, Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods, Mathematical Programming, Series B 87 (2000), 303-316.
155. A. Shapiro, First and second order analysis of nonlinear semidefinite programs, Mathematical Programming, Series B 77 (1997), 301-320.
156. N. Z. Shor, Application of the method of gradient descent to the solution of the network transportation problem, Materials of the Scientific Seminar on Theoretical and Applied Questions of Cybernetics and Operations Research, Ukrainian Academy of Sciences, Kiev, 1962, pp. 9-17 (Russian).
157. N. Z. Shor, Minimization Methods for Non-Differentiable Function, Naukova Dumka, Kiev, 1979 (Russian), English transl., Springer-Verlag, Berlin, 1985.
158. M. Slater, Lagrange multipliers revisited: a contribution to non-linear programming, Discussion paper, Cowles Commission, 1950.
159. G. Sonnevend, An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, System Modelling and Optimization (Budapest, 1985), Lecture Notes in Control and Information Sciences, vol. 84, Springer-Verlag, Berlin, 1986, pp. 866-879.
160. G. Stephanopoulos and W. Westerberg, The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization, Journal of Optimization Theory and Applications 15 (1975), 285-309.
161. M. Studniarski and V. Jeyakumar, A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization, SIAM Journal on Optimization 24 (1995), 883-894.
162. M.Valadier, Sous-différentiels d'une borne supérieure et d'une somme continue de fonctions convexes, Comptes Rendus de l'Académie des Sciences Paris, Série I 268 (1969), 39-42.
163. R. J. Vanderbei, Linear Programming: Foundations and Extensions, Kluwer, Dordrecht, 1997.
164. V. N. Vapnik, The Nature of Statistical Learning Theory. Second Edition, Springer-Verlag, New York, 2000.
165. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, Princeton, New Jersey, 1947.
166. A. P. Wierzbicki, A penalty function shifting method in constrained static optimization and its convergence properties, Archiwum Automatyki i Telemechaniki 16 (1971), 395-416.
167. A. P.Wierzbicki and S. Kurcyusz, Projection on a cone, penalty functionals and duality theory for problems with inequality constraints in Hilbert space, SIAM Journal on Control and Optimization 15 (1977), 25-56.
168. R. B.Wilson, A simplicial algorithm for concave programming, Ph.D. thesis, Graduate School of Business Administration, Harvard University, Cambridge, Massachusetts, 1963.
169. M. A. Wolfe, Numerical Methods for Unconstrained Optimization, Van Nostrand Reinhold, New York, 1978.
170. H. Wolkowicz, R. Saigal, and L. Vandenberghe (eds.), Handbook of Semidefinite Programming. Theory, Algorithms, and Applications, Kluwer, Boston, 2000.
171. S. J. Wright, Primal-Dual Interior-Point Methods, SIAM Publications, Philadelphia, 1997.
172. Y. Ye, Interior Point Algorithms; Theory and Analysis, Wiley, New York, 1997.
173. W. I. Zangwill, Non-linear programming via penalty functions, Management Science 13 (1967), 344-358.