Abstract
In the classical Mathematical Analysis, the functions under study are, mostly, differentiable. Nonsmooth Analysis came into being in the 60’s of the XXth century. Its appearance was requested by practical problems of industry, airspace engineering, economics, other sciences where nonsmooth mathematical models were employed to describe more adequately the processes to be investigated. One of the most important problems in Mathematical Analysis is that of finding extremal values of a functional. The same is true in Nonsmooth Analysis. In the present notes, the problem of finding extremal values of a functional defined on some space is discussed. If there are no constraints on the variables, the problem is called the unconstrained optimization problem. If constraints are present, the problem becomes the constrained optimization one.
Keywords
- Penalty Function
- Directional Derivative
- Constrain Optimization Problem
- Exact Penalty
- Nonsmooth Analysis
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aban’kin A. E., On exact penalty functions, Vestnik of St. -Petersburg University. Ser. 1, 1966, Issue 3, 13, 3–8.
Bertsekas D., Necessary and sufficient conditions for a penalty function to be exact, Mathematical Programming, 1975. Vol. 9, 1, 87–99.
Bertsekas D., Constrained optimization and Lagrange multiplier methods. New York, Acalemic Press. 1982.
Boukary D, Fiacco A. V., Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993, Optimization, 1995. Vol. 32, 4, 301–334.
Bulatov V. P., Imbedding methods in optimization problems (In Russian). Novosibirsk: Nauka Publishers, 1977. 158 p.
Clarke F., Generalized gradients and applications, Trans. Amer. Math. Soc, 1975, 205, 2, 247–262.
Clarke, F. H., Optimization and nonsmooth analysis., N. Y.: Wiley, 1983, 308 p.
Danskin J. M., The theory of max-min, with applications, SIAM J. on Applied Math., 1966. Vol. 14, p. 641–664.
Danskin J. M., The theory of Max-min and its Application to weapons Allocation Problems. Berlin, Springer. 1967.
De Giorgi E., Marino A., Tosques M., Problemi di evoluzione in spazi metricie curve di massima pendenza, Atti Acad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur., 1980. Vol. 6, 68, 180–187.
Demyanov V. F., Conditional derivatives and exhausters in Nonsmooth Analysis. shape Doklady of the Russian Academy of Sciences, 1999, 338, No. 6, 730-733.
Demyanov V. F. and Rubinov A. M., Exhaustive families of approximations revisited. In: R. P. Gilbert, P. D. Panagiotopoulos, P. M. Pardalos (Eds. ) shape From Convexity to Nonconvexity. Nonconvex Optimization and Its Applications, 2001. 55, 43–50. (Dordrecht: Kluwer Scientific Publishers).
Demyanov V. F., On the solution of some minimax problems. Part I, Kibernetika, 1966. 6, 58–66. Part II, Kibernetika, 1967, 3, 62–66.
Demyanov V. F., Exact penalty functions in nonsmooth optimization problems., Vestnik of St. -Petersburg University. Ser. 1, 1994. Issue 4, 22, 21–27.
Demyanov V. F., On the minimization of a maximal deviation, Vestnik of Leningrad University, 1966, Ser. 1, 7, 21–28.
Demyanov V. F., Exhausters and convexificators – new tools in Nonsmooth Analysis, In: [88], 2000, 85–137.
Demyanov V. F., Rubinov A. M. On quasidifferentiable functionals, Doklady of USSR Acad. of Sci, 1980, 250, 1, 21–25.
Demyanov V. F., Rubinov A. M., Elements of Quasidifferential Calculus, In: “Nonsmooth Problems of Optimization Theory and Control”. (In Russian). Ed. V. F. Demyanov. – Leningrad: Leningrad University Press, 1982, Ch. 1, 5-127. English revised version see in [88], 1–31.
Demyanov V. F., Jeyakumar V., Hunting for a smaller convex subdifferential, J. of Global Optimization, 1997, 10, 3, 305–326.
Demyanov V. F., Di Pillo G., Facchinei F., Exact penalization via Dini and Hadamard conditional derivatives, Optimization Methods and Software, 1998, 9, 19–36.
Demyanov V. F., Rubinov A. M., Quasidifferential Calculus., New York: Optimization Software, 1986. xi + 288 p.
Demyanov V. F., Exhausters of a positively homogeneous function, Optimization., 1999, 45, P. 13–29.
Demyanov V. F., Convexification of a positively homogeneous function, Doklady of the Russian Academy of Sciences., 1999, 366, N. 6, P. 734–737.
Demyanov, V. F., Dixon, L. C. W., (Eds.): Quasidifferential calculus. Mathematical Programming Study, 1985, Vol. 29, 221 p.
Demyanov, V. F., Vasiliev, L. V., Nondifferentiable Optimization. New York: Springer-Optimization Software, 1986 (Russian Edition, Moscow: Nauka, 1981).
Demyanov, V. F., Malozemov, V. N., Introduction to Minimax. Moscow: Nauka, 1972, 368 p. (English translation by J. Wiley, 1974, 2nd edition, 1990).
Demyanov V. F., Conditions for an Extremum in Metric Spaces., Journal of Global Optimization, 2000. Vol. 17, Nos. 1-4. P. 55–63.
Demyanov V. F., Rubinov A. M., Foundations of nonsmooth analysis. Quasidifferential Calculus. (In Russian) Moscow: Nauka publishers, 1990. 431 p.
Demyanov V. F., Rubinov A. M., Constructive Nonsmooth Analysis. Frankfurt a/M. : Verlag Peter Lang, 1995. 416 p.
Demyanov V. F., Di Pillo G., Facchinei F., Exact penalization via Dini and Hadamars conditional derivatives., Optimization Methods and Software, 1998. Vol. 9. P. 19–36.
Di Pillo G., Exact penalty methods., Ed. E. Spedicato: Algorithms for Continuous Optimization. The State-of-the-Art. NATO ASI Series C, Vol. 434. Dordrecht: Kluwer Academic Publishers, 1994. P. 209–253.
Di Pillo G., Facchinei F., Exact penalty functions for nondifferentiable programming problems., Eds. F. H. Clarke, V. F. Demyanov and F. Giannessi: Nonsmooth Optimization and Related Topics. N. Y. : Plenum, 1989. P. 89–107.
Di Pillo G., Grippo L., Exact penalty functions in constrained optimization., SIAM J. on Contr. and Optimiz., 1989. Vol. 27 P. 1333–1360.
Dubovitski, A. Ya., Milyutin, A. A., Extremal problems in the presence of constraints, USSR Comput. Mathematics and Math. Physics, 1965, Vol. 5, No. 3, 395–453.
Eremin I. I., On the penalty method in convex programming, Abstracts of Intern. Congress of Mathematicians. Section 14. Moscow, 1966.
Eremin I. I., Penalty methods in convex programming (in Russian), Doklady of the USSR Academy of Sciences, 1967, Vol. 143, N 4, P. 748–751.
Eremin, I. I., Astafiev, N. N., Introduction to Theory of Linear and Convex Programming (in Russian), Moscow: Nauka, 1976, 192 p.
Ermoliev Yu. M., Methods for solving nonlinear extremum problems, Kibernetika, 1966, N. 4, 1–17.
Ermoliev Yu. M., Stochastic programming methods. (In Russian) Moscow: Nauka publishers, 1976. 240 p.
Evtushenko Yu. G., Zhadan V. G., Exact auxilliary functions in optimization problems, J. of computational mathematics and mathematical physics 1990. Vol. 30, N 1. P. 43–57.
Fedorov V. V., Numerical methods for maximin problems. (In Russian) Moscow: Nauka publishers, 1979. 278 p.
Fiacco A. V., McCormick G. P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques. New York: John Wiley and Sons, Inc., 1987.
Fletcher R., Penalty functions, Mathematical programming: the-State-of-the-Art., Eds. A. Bachen, M. Grötschel, B. Korte). Berlin: Springer–Verlag, 1983. P. 87–114.
Gabasov R., Kirillova F. M., Optimization methods. (In Russian) Minsk: Belarus University Press, 1981. 350 p.
Galeev E. M., Tikhomirov V. N., A short course of extremal problems theory. Moscow, Moscow University Press, 1989. 204 p.
Giannessi F., A Common Understanding or a Common Misunderstanding?, Numer. Funct. Anal. and Optimiz., 1995. Vol. 16, 9-10, 1359–1363.
Giannessi F., Nicolucci F., Connections between nonlinear and integer programming problems., Symposia Mathematica, 1976, Vol. 19, 161–175.
Girsanov I. V., Lectures on the Mathematical Theory of Extremum Problems.–Moscow: Moscow Univ. Press, 1970, 118 p.
Golshtein E. G., Duality theory in mathematical programming and its applications. (In Russian) Moscow: Nauka publishers, 1971. 352 p.
Gorokhovik, V. V., ε-quasidifferentiability of real-valued functions and optimality conditions in extremal problems. In: [24], 203–218.
Grossman K., Kaplan A. A., Nonlinear programming via unconstrained minimization. (In Russian) Novosibirsk: Nauka publishers, 1981. 184 p.
Han S., Mangasarian O., Exact penalty functions in nonlinear programming., Math. Progr., 1979, 17, 251–269.
Hiriart-Urruty J. B., Lemarechal C., Convex analysis and Minimization algorithms I, II. Berlin: Springer-Verlag, 1993. 420 p., 348 p.
Hiriart-Urruty J.-B., New concepts in nondifferentiable programming., Bul. Soc. Math. France, 1979, Mem. 60, 57–85.
Ioffe A. D., A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and non-functional constraits, Mathematical Programming., 1993, 58, 137–145.
Ioffe A. D., Tikhomirov V. M., Theory of Extremal Problems. Moscow: Nauka, 1974, 480 p. (English transl. by North-Holland, 1979).
Ioffe A. D., Nonsmooth analysis: differential calculus of nondifferentiable mappings, Trans. Amer. Math. Soc, 1981, 266, 1, 1–56.
Ioffe, A. D. Tikhomirov, V. M., Theory of Extremal Problems., Moscow: Nauka, 1974, 479 p. (English transl. by North-Holland, Amsterdam, New York, 1979).
Ioffe A. D., Metric regularity and subdifferential calculus, Uspehi Matem. nauk, 2000, 55, 3, 103–162.
Kaplan A. A., Tichatschke R., Stable methods for ill-posed variational problems. Berlin: Akademie Verlag, 1994.
Karmanov V. G., Mathematical Programming. In Russian Moscow: Nauka publishers, 1980, 256 p.
Kiwiel K. C., Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, Math. Progr., 1991, 52, 285–302.
Kruger A. Ya., On properties of generalized differentials, Syberian Math. J., 1985, 26, 54–66.
Kusraev A. G., Kutateladze S. S., Subdifferentials: Theory and Applications, New York: Kluwer Academic Publishers, 1995.
Kutateladze S. S., Rubinov A. M., Minkowski duality and its applications, Russian Mathem. Surveys, 1972, 27, 131–191.
Luderer B., Rosiger R., Wurker U., On necessary minimum conditions in quasidifferential calculus: independence on the specific choice of quasidifferential, Optimization, 1991, 22, 643–660.
Mangasarian O. L., Sufficiency in exact penalty minimization, SIAM J. on Contr. and Optimiz., 1985. Vol. 23, P. 30–37.
Michel P., Penot J.-P., Calcus sous-differential pour les fonctions lipschitzienness et non-lipschitziennes, C. R. Acad. Sc. Paris, Ser. I, 1984, 298, 269–272.
Mordukhovich B. S., Nonsmooth analysis with nonconvex generalised differentials and conjugate mappings, Doklady of BSSR Acad. of Sci, 1984, 28, No. 11, P. 976–979.
Mordukhovich B. S., Approximation methods in problems of optimization and control. (In Russian), Moscow: Nauka, 1988, 359 p.
Moreau J.-J., Fonctionelles sous-differentiables, C. R. Acad. Sci. Paris, Ser. A-B, 1963, 257, P. 4117–4119.
Neustadt L. W., Optimization: A theory of necessary conditions. Princeton, N. J. : Princeton University Press, 1976. xii + 424 p.
Nurminski E. A., A quasigradient method for solving the mathematical programming problem, Kibernetika, 1973, 1, 122–125.
Pallaschke D., Rolewicz S., Foundations of mathematical optimization. Convex analysis without linearity. Dordrecht: Kluwer Academic Publishers, 1997. xii + 582 p.
Panin V. M., Finite penalties methods with linear approximation. Part I, Kibernetika, 1984, 2, 44–50. Part II, Kibernetika, 1984, 4, 73–81.
Penot J.-P., Sous-differentiels de fonctions numeriques non convexes, C. R. Acad. Sc. Paris, Ser. A, 1974, 278, 1553–1555.
Pietrzykowski T., An exact potential method for constrained maxima, SIAM J. on Numer. Anal., 1969, 6, 299–304.
Polak E., Computational Methods in Optimization: A Unified Approach. N. Y. : Academic Press, 1971.
Polyak B. T., A general method for solving extremum problems, Dokl. AN SSSR, 1967, 174, 1, 33–36.
Polyak B. T., Minimization of nonsmooth functionals, Zhurn. Vychisl. Matem. i Matem. Fiz, 1969, 9, 3, 509–521.
Polyak B. T., Introduction to Optimization. (In Russian) Moscow: Nauka publishers, 1983, 384 p.
Polyakova, L. N., Necessary conditions for an extremum of a quasidifferentiable function subject to a quasidifferentiable constraint, Vestnik of Leningrad Univ., 1982, 7, 75–80.
Polyakova L. N., On an exact penalty method for quasidifferentiable functions, J. of comptutational mathematics and mathematical physics 1990, 30, 1, 43–57.
Pschenichny B. N., Danilin Yu. M., Numerical methods in extremal problems. (In Russian) Moscow: Nauka publishers, 1975, 320 p.
Pschenichny B. N., Convex Analysis and Extremal Problems (in Russian), Moscow: Nauka, 1980, 320 p.
Pschenichny B. N., Necessary conditions for an extremum. 2nd ed., Moscow: Nauka, 1982, 144 p. (English translation of the 1st ed. by Marsel Dekker, New York, 1971).
Pschenichny B. N., Method of Linearization., Moscow: Nauka, 1983, 136 p.
Quasidifferentiability and Related Topics., Nonconvex Optimization and its Applications, Vol. 43. Eds. V. Demyanov, A. Rubinov, Dordrecht/Boston/London: Kluwer Academic Publishers, 2000, xix + 391 p.
Rockafellar R. T., Duality theorems for convex functions, Bull. Amer. Math. Soc, 1964, 70, 189–192.
Rockafellar R. T., The theory of subgradients and its application to problems of optimization., Berlin: Holdermann, 1981, 107p.
Rockafellar, R. T., Convex Analysis. Princeton N. J: Princeton Univ. Press, 1970.
Rockafellar R. T., Lagrange multipliers and optimality, SIAM Review., 35, 2, 183–238.
Rockafellar R. T., Wets R. J. B., Variational Analysis. Berlin: Springer, 1998. xiii + 733 p.
Roshchina V., On the relationship between the Fréchet subdifferential and upper exhausters, shape International Workshop on Optimization: Theory and Algorithms. 19 - 22 August 2006, Zhangjiajie, Hunan, China.
Roshchina V., Relationships Between Upper Exhausters and the Basic Subdifferential in Variational Analysis, J. Math. Anal. Appl. (2007), doi: 10. 1016/j. jmaa. 2006. 12. 059.
Rubinov A. M., Abstract convexity and global optimization. Dordrecht: Kluwer Academic Publishers, 2000. xviii + 490 p.
Rubinov A. M., Yang X. Q., Glover B. M., Extended Lagrange and penalty functions in optimization, J. of Optimiz. Theory and Appl., 2001, 111, 2, 381–405.
Shapiro A., On concepts of directional differentiability, J. Optim. Theory Appl. 66 (1990), 3, 477–487.
Shor N. Z., The development of numerical methods for nonsmooth optimization in the USSR, In: History of Mathematical Programming, J. K. Lenstra, A. H. G. Rinnoy Kan, and A. Shrijver, eds., Amsterdam, CWI, North-Holland, 1991, 135–139.
Shor N. Z., On a method for minimizing almost-differentiable functions, Kibernetika, 1972, 4, 65–70.
Shor N. Z., Methods for minimizing nondifferentiable functions. (In Russian) Kiev: Naukova dumka publishers, 1979. 199 p.
Studniarski M., Necessary and sufficient conditions for isolated local minimum of nonsmooth functions, SIAM J. Control and Optimization, 1986, 24, 1044–1049.
Sukharev A. G., Timokhov A. V., Fedorov V. V., A course of optimization methods. (In Russian) Moscow: Nauka publishers, 1986, 325 p.
Tretyakov N. V., An exact estimates method for convex programming problems, Economics and mathematical methods, 1972, 8, 5, 40–751.
Uderzo A., Quasi-multiplier rules for quasidifferentiable extremum problems, Optimization, 2002, 51, 6, 761–795.
Vasiliev F. P., Numerical methods of solving extremal problems. Moscow, Nauka publishers, 1980. 520 p.
Ward D. E., Exact penalties and sufficient conditions for optimality in nonsmooth optimization, J. of Optimiz. Theory and Appl., 1988, 57, 485–499.
Xia, Z. Q., On mean value theorems in quasidifferential calculus, J. Math. Res. and Exposition, Dalian, China, D. I. T., 1987, 4, 681–684.
Yudin D. B., Golshtein E. G., Linear programming. Theory and finite methods. (In Russian) Moscow: Fizmatgiz publishers, 1963, 775 p.
Zaffaroni A., Continuous approximations, codifferentiable functions and minimization methods, In: [88], 2000, P. 361–391.
Zangwill W. I., Non-linear programming via penalty functions, Management Science, 1967, 13, 5, 344–358.
Zangwill W. I., Nonlinear Programming: A Unified Approach. Prentice Hall, Englewood Cliffs, 1969.
Zoutendijk G., Methods of feasible directions – A study in Linear and Nonlinear Programming. Amsterdam, Elsevier, 1960.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Demyanov, V.F. (2010). Nonsmooth Optimization. In: Di Pillo, G., Schoen, F. (eds) Nonlinear Optimization. Lecture Notes in Mathematics(), vol 1989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11339-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-11339-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11338-3
Online ISBN: 978-3-642-11339-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
