Abstract
Methods of nonsmooth optimization, particularly the r-algorithm, are applied to the problem of fitting an empirical utility function to expert’s estimates of ordinal utility under certain a priori constraints. Due to these methods, the fit can be performed not only with respect to the least squares criterion but with respect to the least moduli criterion, and with respect to the minimax (Chebyshev) criterion as well. Besides, nonsmooth constraints, providing the convexity or concavity of the utility function, are manageable.
This is a preview of subscription content, log in via an 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
Agmon, D. (1954): “The relaxation method for linear inequalities,” Canad. J. Math., 6, 382–392.
Clarke, F.H. (1983): Optimization and Nonsmooth Analysis, Wiley, New York.
Debreu, G. (1952): “Definite and Semidefinite Quadratic Forms,” Econometrica, 20, 295–300.
Demiyanov, V.F., and VASILIEV, L.V. (1985): Nondifferentiable Optimization, Optimization Software, New York.
Eremin, I.I. (1967): “On a penalty method in convex programming,” Kibernetika, No. 4, 63–67 (Russian).
Yu.M. Ermoliev (1966): “Methods for solving nonlinear extremal problems,” Kibernetika, No. 4, 1–17 (Russian).
Yu.M. Ermoliev (1976): Stochastic Programming Methods, Nauka, Moscow (Russian).
Ermoliev, YU. M., and N.Z. Shor (1968):“Method of random walk for the two-stage problem of stochastic programming and its generalization”, Kibernetika, 4(1), 59–60 (Russian).
Huber, P.J. (1981): Robust Statistics, Wiley, New York.
Khachiyan, L.G. (1979): “A polynomial algorithm in linear programming”, Soviet Math. (Doklady), 20, 191–194.
Kiwiel, K.C. (1985): Methods of Descend for Nondifferentiable Optimization, Lecture Notes in Mathematics 1133, Springer, Berlin.
Lemarechal, C. (1975): “An extension of Davidon methods to nondifferentiable problems,” Math. Program. Study., 3, North-Holland, Amsterdam, 95–109.
Motzkin, T., and I. Shoenberg (1954): “The relaxation method for linear inequalities,” Canad. J. Math., 6, 393–404.
Polyak, B.T. (1967): “A general method of solving extremum problems,” Soviet Mathematics (Doklady), 8, 593–597.
Pshenichny, B.N. (1983): Methods of linearization, Nauka, Moscow. (Russian).
Rockafellar, R.T. (1970): Convex Analysis, Princeton University Press.
Shor, N.Z. (1962): “An application of the method of gradient descent to the solution of the network transportation problem,” in: Materialy Nauchnogo Seminara po Teoreticheskim i Prikladnym Voprosam Kibernetiki i Issledovaniu Operacii, Nauchnyi Sovet po Kibernetike Akademii Nauk Ukrainskoi SSR, 1, 9–17 (Russian).
Shor, N.Z. (1964):“On the structure of algorithms for numerical solution of problems of optimal planning and design, “Diss. Doctor Philos., Kiev (Russian).
Shor, N.Z. (1970): “On the speed of convergence of the method of generalized gradient descent with space dilation,” Kibernetika, No. 2, 80–85 (Russian).
Shor, N.Z. (1977): “Cut-off method with space dilation in convex programming problems,” Kibernetika, No. 13, 94–96.
Shor, N.Z. (1985): Minimization Methods for Nondifferentiable Functions, Springer, Berlin.
Shor, N.Z. (1998): Nondifferentiable optimization and polynomial problems, Kluwer, Dordrecht.
V.I. Biletskii (1969): “A method of space dilation for accelerating convergence in gully-type problems.” In: Teor. Optimal Resenii, Trudy Sem. Nauchn. Soveta Akad. Nauk Ukrain. SSR po Kibernetike, 2, 3–18, Kiev (Russian).
N.G. Zhurbenko (1971): “A minimization method using the operation of space dilation in the direction of the difference of two successive gradients”, Kibernetika, 3, 51–59 (Russian).
S.I. Stetsenko (1989): Quadratic extremal problems and nondifferentiable optimization, Naukova dumka, Kyiv (Russian).
Tangian, A.S. (1998): Constructing Quasi-Concave Quadratic Objective Functions, FernUniversität Hagen, Discussion Paper No. 263.
Tangian, A.S. (2000): A Model for Constructing Monotonic Quasi-Concave Quadratic Utility Functions. FernUniversität Hagen, Discussion Paper No. 291.
Tangian, A.S. (2001): “A unified model for cardinally and ordinally constructing quadratic objective functions,” elsewhere in the volume.
J. Gruber (1997): “Constructing Quadratic and Polynomial Objective Functions,” in: Constructing Scalar-Valued Objective Functions, ed. by A.S. Tangian and J. Gruber, Lecture Notes in Economics and Mathematical Systems, 453, Springer, Berlin, 166–194.
Wolfe, P. (1975): “A method of conjugate subgradient for minimizing nondifferentiable functions,” Math. Program. Study, 3, North-Holland, Amsterdam, 145–173.
Yudin, D.B., and A.S. Nemirovski (1976): “Informational complexity and efficient methods for solving complex extremal problems,” Matekon 13(3), 25–45 (Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shor, N.Z., Stetsyuk, P.I. (2002). Constructing Utility Functions by Methods of Nondifferentiable Optimization. In: Tangian, A.S., Gruber, J. (eds) Constructing and Applying Objective Functions. Lecture Notes in Economics and Mathematical Systems, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56038-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-56038-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42669-1
Online ISBN: 978-3-642-56038-5
eBook Packages: Springer Book Archive