Article Outline
Keywords
Constraints on the Variables
Finding a Minimum Point
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agmon S (1954) The relaxation method for linear inequalities. Canad J Math 6:282–292
Brännlund U (1993) On relaxation methods for nonsmooth convex optimization. PhD Thesis, Kungliga Tekniska Högskolan, Stockholm
Brännlund U, Kiwiel KC, Lindberg PO (1995) A descent proximal level bundle method for convex nondifferentiable optimization. Oper Res Lett 17:121–126
Goffin J-L, Kiwiel KC (1999) Convergence of a simple subgradient level method. Math Program 85(1):207–211
Lemaréchal C, Nemirovskii AS, Nesterov YuE (1995) New variants of bundle methods. Math Program 69:111–147
Motzkin TS, Schoenberg IJ (1954) The relaxation method for linear inequalities. Canad J Math 6:393–404
Nemirovsky AS, Yudin DB (1983) Problem complexity and method efficiency in optimization. Ser Discret Math, Wiley, New York
Polyak BT (1969) Minimization of unsmooth functionals. USSR Comput Math Math Phys 9:14–29
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Brännlund, U. (2008). Nondifferentiable Optimization: Relaxation Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_450
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_450
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering