Separating plane algorithms for convex optimization

Mathematical Programming, Series B

Volumn 76, Issue 3, 1997, Pages 373-391

  Nurminski, Evgeni A ^a  

^a INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

Convex optimization; Separating plane algorithms

Indexed keywords

EID: 0013543222     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614389     Document Type: Article

References (30)

1. V.F. Demyanov and V.N. Malozemov, Introduction to Minimax (Wiley, New York, 1974).
2. S.-P. Han and O. Mangasarian, Exact penalty functions in nonlinear programming, Mathematical Programming 17 (1979) 251-269.
3. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Parts I and II (Springer, Berlin, 1993).
4. J.B. Kelley, The cutting plane method for solving convex programs, SIAM 8(4) (1960) 703-712.
5. K. Kiwiel, A survey of bundle methods for nondifferentiable optimization, in: Proceedings, XIII International Symposium on Mathematical Programming (Tokyo, 1988).
6. K. Kiwiel, Proximity control in bundle methods for convex nondifferentiable minimization, Mathematical Programming 46 (1990) 105-122.
7. A.V. Kuntzevich and S.V. Rzhevski, Application of ε-subgradient method for solving dual and primal mathematical programming problems, Kibernetika 5 (1985) 51-54.
8. C. Lemaréchal, Nondifferentiable optimization, in: E. Spedicato, L.C.W. Dixon and G.P. Szegö, eds., Nonlinear Optimization (Birkhäuser, Boston, 1980) 84-93.
9. C. Lemaréchal, Numerical experiments in nonsmooth optimization, in: E. Nurminski, ed., Progress in Nondifferentiable Optimization, Collaborative Proceedings (IIASA, Laxenburg, 1982) 61-84.
10. C. Lemaréchal, Nondifferentiable optimization, in: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds., Handbooks in Operations Research and Management Science, Vol. 1. Optimization (North-Holland, Amsterdam, 1989) 529-572.
11. C. Lemaréchal and R. Mifflin, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, Mathematical Programming 24 (1982) 241-256.
12. L. Luksan, Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation, Applikace Matematiky 31(5) (1986) 379-395.
13. R. Mifflin, A stable method for solving certain least squares problems, Mathematical Programming 16 (1979) 141-158.
14. R. Mifflin, A rapidly convergent five-point algorithm for univariate minimization, Mathematical Programming 62 (1993) 299-319.
15. R. Mifflin and J.-J. Strodiot, A bracketing technique to ensure desirable convergence in univariate minimization, Mathematical Programming 43 (1989) 117-130.
16. A.S. Nemirovski and D.B. Judin, Estimation of the information complexity of mathematical programming problems, Matecon 13 (1979) 2-25, 25-45.
17. E.A. Nurminski, Convex optimization with constraints, Kibernetika 4 (1987) 29-31.
18. E.A. Nurminski, Numerical Methods of Convex Optimization (Nauka, Moscow, 1991).
19. E.A. Nurminski, Superlinear convergence in convex nondifferentiable optimization, in: W. Oettli and D. Pallaschke, eds., Advances in Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 382 (Springer, Berlin, 1991) 267-280.
20. E.A. Nurminski, Separating plane algorithms for convex optimization with linear constraints, Technical report 443, Bayreuth University (Bayreuth, 1993).
21. E.A. Nurminski, Acceleration of iterative methods of projection on polyhedron, Far-Eastern Mathematical Reports 1 (1995) 51-62.
22. E.A. Nurminski, A quadratically convergent line-search algorithm for piece-wise smooth convex optimization, Optimization Methods and Software 6 (1995) 59-80.
23. M.B. Schepakin, On the method of orthogonal descent, Kibernetika 1 (1987) 58-62.
24. H. Schramm, Eine Kombination von Bundle- und Trust-Region-Verfahren zur Lösung nichtdifferenzierbarer Optimierungsprobleme, Haft 30, Bayreuther Mathematische Schriften (Bayreuth, 1989).
25. H. Schramm, J. Outrata and J. Zowe, Bundle trust methods: Fortran codes for nondifferentiable optimization, User's guide, Report 269, Mathematische Institute, Universität Bayreuth (Bayreuth, 1991).
26. H. Schramm and J. Zowe, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM Journal on Optimization 2 (1992) 121-152.
27. N.Z. Shor, Minimization Methods for Nondifferentiable Optimization (Springer, Berlin, 1985).
28. P. Wolfe, Finding the nearest point in a polytope, Mathematical Programming 11 (2) (1976) 128-149.
29. N.G. Zhurbenko and N.Z. Shor, A minimization method using the operation of extension of space in the direction of the difference between two successive gradients, Kibernetika 7 (1971) 51-59.
30. J. Zowe, Nondifferentiable optimization, in: K. Schittkowski, ed., Computational Mathematical Programming, NATO ASI Series, Vol. F15 (Springer, Heidelberg, 1985) 323-356.