Nonsmooth Optimization and Descent Methods

838 12 853 2 1690 document 853 RR-78-004.pdf application/pdf cb379225a4ebaf0bccd8a726136a2008 MD5 533102 2016-01-15 01:44:43 https://pure.iiasa.ac.at/id/eprint/838/1/RR-78-004.pdf 838 1 1 text en public

RR-78-004.pdf

14 27956 1 39688 document 27956 indexcodes.txt text/x-c++ b425d21b09ef684d7220910ff5d2a3a9 MD5 4701 2016-01-15 21:36:41 https://pure.iiasa.ac.at/id/eprint/838/2/indexcodes.txt 838 2 2 text/x-c++ other Generate index codes conversion from text to indexcodes en public

indexcodes.txt

lightbox.jpg

preview.jpg

medium.jpg

small.jpg

RR-78-004.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/853 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/853 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/853 archive 351 disk0/00/00/08/38 2016-01-15 01:44:43 2021-08-27 17:08:49 2016-01-15 01:44:43 monograph show 2 Lemarechal C. AL0228 Nonsmooth Optimization and Descent Methods pub iis_met prog_sds Nonsmooth optimization is a field of research actively pursued at IIASA. In this paper, we show "what" it is; a thing that cannot be guessed easily from its definition by a negative statement. Also, we show "why" it exists at IIASA, by exhibiting a large field of applications ranging from the theory of nonlinear programming to the computation of economic equilibria, including the general concept of decentralization. Finally, we show "how" it can be done, outlining the state of the art, and developing a new algorithm that realizes a synthesis between the concepts commonly used in differentiable as well as nondifferentiable optimization. Our approach is as non-technical as possible, and we hope that a nonacquainted reader will be able to follow a non-negligible part of our development. In Section 1, we give the basic concepts underlying nonsmooth optimization and show what it consists of. We also outline the classical methods, which have existed since 1959, aimed at optimizing nondifferentiable problems. In Section 2, we give a list of possible applications, including acceleration of gradient type methods, general decomposition--by prices, by resources, and Benders decomposition--minimax problems, and computation of economic equilibria. In Section 3, we give the most modern methods for nonsmooth optimization, defined around 1975, which were the first general descent methods. In Section 4, we develop a new descent method, which is based on concepts of variable metric, cutting plan approximation and feasible directions. We study its motivation, its convergence, and its flexibility. 1978-03 published RR-78-004 RR-78-004 10 2110 public research_report IIASA, Laxenburg, Austria 25 TRUE FALSE info:eu-repo/semantics/book