Abstract
The motivations for constructing algorithms with the properties specified in the title of this paper come from two sources. The first is that the ellipsoid method (see e.g. Shor (1982) and Sonnevend (1983)) has a slow (asymptotic) convergence for functions of the above two classes. The second arises since the popular idea (practice) that the globalization of convergence for the asymptotically fast quasi-Newton methods should be achieved by the application of line search strategies (these are described in Stoer (1980); bundle methods are described in Lemarechal et al. (1981)) becomes rather questionable if function and subgradient evaluations are costly and if the function is “stiff”, i.e. has badly conditioned or strongly varying second derivatives (Hesse matrixes). Indeed, line search uses — intuitively speaking — the local information about the function only for local prediction, while in the ellipsoid method the same information is used to obtain a global prediction (based on a more decisive use of the convexity). In the bundle (ε-subgradient) methods the generation of a “useable” descent direction (not speaking about the corresponding line search) may require — for a nonsmooth f (in the “zero-th” steps) — a lot of function (subgradient evaluations). The important feature of the ellipsoid method, which will be used here to obtain a method with finite termination (i.e. exact computation of f*) for piecewise linear functions (which is very important for the solution of general linear programming problems), is that it provides us with (asymptotically exact) lower bounds for the value of*.
Keywords
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, 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
Ech-Cherif, A., Ecker K.G. (1984), “A class of rank two ellipsoid algorithms for convex programming”, Math. Programming 29 (2): 187–202.
Gill, P.E, Murray, W.,Saunders,N.A. and Wright,M.H., (1982) A numerical investigation of ellipsoid algorithms for large scale linear programming, in G.B. Dantzig, M.A.H. Dempster and M.J. Kallio (eds.) Large-Scale Linear Programming,IIASA Proceedings Series, CP-81-S1: 487–511 (vol.1.)
König, H., Pallaschke, D. (1981), “On Khachian’s Algorithm and Minimal Ellipsoids”, Numerische Mathematik (36), 2: 197–211
Lemarechal, C., Strodiot,J.J., and Bihain,A. (1981), “On a Bundle Algorithm for Nonsmooth Optimization”, in O.L. Mangasarianr R.R. Meyer and S.M. Robinson (eds.), Nonlinear Programming, Academic Press, New York.
Ortega, J.M, Rheinbolt, W.C. (1970), Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York
Shor, N.Z. (1982), “Generalized Gradient Methods of Non-differentiable Optimization Employing Space Dilatation
Operations“, in A. Bachem, M. Grötschel, and B. Korte (eds.), Mathematical Programming, The State of Art, Springer, Berlin.
Sonnevend,Gy. (1983), “Stabilization of the ellipsoid method for computing the minimal value of a convex function” to appear in Applied Mathematics and Optimization
Sonnevend,Gy. (1984), “Acceleration and Implementations of the method of centers of gravity, IIASA Collaborative Paper, System and Decision Sciences Program, IIASA, Laxenburg, Austria, 15 p.
Stoer, J. (1980) Introduction to Numerical Analysis, Springer, Berlin
Zowe,J. (1984) Nondifferentiable Optimization, to appear in ASI Proceedings on Computational Mathematical Programming (Conf. at Bad Windsheim, July 1984 )
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sonnevend, G. (1985). A Modified Ellipsoid Method for the Minimization of Convex Functions with Superlinear Convergence (or Finite Termination) for Well-Conditioned C 3 Smooth (or Piecewise Linear) Functions. In: Demyanov, V.F., Pallaschke, D. (eds) Nondifferentiable Optimization: Motivations and Applications. Lecture Notes in Economics and Mathematical Systems, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12603-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-662-12603-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15979-7
Online ISBN: 978-3-662-12603-5
eBook Packages: Springer Book Archive