Methods of Descent for Nondifferentiable Optimization
Author: Krzysztof C. Kiwiel
Publisher: Springer
Published: 2006-11-14
Total Pages: 369
ISBN-13: 3540395091
DOWNLOAD EBOOKRead and Download eBook Full
Author: Krzysztof C. Kiwiel
Publisher: Springer
Published: 2006-11-14
Total Pages: 369
ISBN-13: 3540395091
DOWNLOAD EBOOKAuthor: Giovanni Paolo Galdi
Publisher:
Published: 1985
Total Pages: 362
ISBN-13: 9780387156422
DOWNLOAD EBOOKAuthor: Ying Cui
Publisher: Society for Industrial and Applied Mathematics (SIAM)
Published: 2022
Total Pages: 0
ISBN-13: 9781611976731
DOWNLOAD EBOOK"This monograph serves present and future needs where nonconvexity and nondifferentiability are inevitably present in the faithful modeling of real-world applications of optimization"--
Author: Philip Wolfe
Publisher:
Published: 1975
Total Pages: 178
ISBN-13: 9780444110084
DOWNLOAD EBOOKAuthor: Jorge Nocedal
Publisher: Springer Science & Business Media
Published: 2006-12-11
Total Pages: 686
ISBN-13: 0387400656
DOWNLOAD EBOOKOptimization is an important tool used in decision science and for the analysis of physical systems used in engineering. One can trace its roots to the Calculus of Variations and the work of Euler and Lagrange. This natural and reasonable approach to mathematical programming covers numerical methods for finite-dimensional optimization problems. It begins with very simple ideas progressing through more complicated concepts, concentrating on methods for both unconstrained and constrained optimization.
Author: Sergey Repin
Publisher: Springer Science & Business Media
Published: 2012-10-13
Total Pages: 446
ISBN-13: 9400752873
DOWNLOAD EBOOKThis book contains the results in numerical analysis and optimization presented at the ECCOMAS thematic conference “Computational Analysis and Optimization” (CAO 2011) held in Jyväskylä, Finland, June 9–11, 2011. Both the conference and this volume are dedicated to Professor Pekka Neittaanmäki on the occasion of his sixtieth birthday. It consists of five parts that are closely related to his scientific activities and interests: Numerical Methods for Nonlinear Problems; Reliable Methods for Computer Simulation; Analysis of Noised and Uncertain Data; Optimization Methods; Mathematical Models Generated by Modern Technological Problems. The book also includes a short biography of Professor Neittaanmäki.
Author: V.F. Dem'yanov
Publisher: Springer
Published: 1985-12-12
Total Pages: 452
ISBN-13: 9780387909516
DOWNLOAD EBOOKOf recent coinage, the term "nondifferentiable optimization" (NDO) covers a spectrum of problems related to finding extremal values of nondifferentiable functions. Problems of minimizing nonsmooth functions arise in engineering applications as well as in mathematics proper. The Chebyshev approximation problem is an ample illustration of this. Without loss of generality, we shall consider only minimization problems. Among nonsmooth minimization problems, minimax problems and convex problems have been studied extensively ([31], [36], [57], [110], [120]). Interest in NDO has been constantly growing in recent years (monographs: [30], [81], [127] and articles and papers: [14], [20], [87]-[89], [98], [130], [135], [140]-[142], [152], [153], [160], all dealing with various aspects of non smooth optimization). For solving an arbitrary minimization problem, it is neces sary to: 1. Study properties of the objective function, in particular, its differentiability and directional differentiability. 2. Establish necessary (and, if possible, sufficient) condi tions for a global or local minimum. 3. Find the direction of descent (steepest or, simply, feasible--in appropriate sense). 4. Construct methods of successive approximation. In this book, the minimization problems for nonsmooth func tions of a finite number of variables are considered. Of fun damental importance are necessary conditions for an extremum (for example, [24], [45], [57], [73], [74], [103], [159], [163], [167], [168].
Author: Dimitri Bertsekas
Publisher: Athena Scientific
Published: 2003-03-01
Total Pages: 560
ISBN-13: 1886529450
DOWNLOAD EBOOKA uniquely pedagogical, insightful, and rigorous treatment of the analytical/geometrical foundations of optimization. The book provides a comprehensive development of convexity theory, and its rich applications in optimization, including duality, minimax/saddle point theory, Lagrange multipliers, and Lagrangian relaxation/nondifferentiable optimization. It is an excellent supplement to several of our books: Convex Optimization Theory (Athena Scientific, 2009), Convex Optimization Algorithms (Athena Scientific, 2015), Nonlinear Programming (Athena Scientific, 2016), Network Optimization (Athena Scientific, 1998), and Introduction to Linear Optimization (Athena Scientific, 1997). Aside from a thorough account of convex analysis and optimization, the book aims to restructure the theory of the subject, by introducing several novel unifying lines of analysis, including: 1) A unified development of minimax theory and constrained optimization duality as special cases of duality between two simple geometrical problems. 2) A unified development of conditions for existence of solutions of convex optimization problems, conditions for the minimax equality to hold, and conditions for the absence of a duality gap in constrained optimization. 3) A unification of the major constraint qualifications allowing the use of Lagrange multipliers for nonconvex constrained optimization, using the notion of constraint pseudonormality and an enhanced form of the Fritz John necessary optimality conditions. Among its features the book: a) Develops rigorously and comprehensively the theory of convex sets and functions, in the classical tradition of Fenchel and Rockafellar b) Provides a geometric, highly visual treatment of convex and nonconvex optimization problems, including existence of solutions, optimality conditions, Lagrange multipliers, and duality c) Includes an insightful and comprehensive presentation of minimax theory and zero sum games, and its connection with duality d) Describes dual optimization, the associated computational methods, including the novel incremental subgradient methods, and applications in linear, quadratic, and integer programming e) Contains many examples, illustrations, and exercises with complete solutions (about 200 pages) posted at the publisher's web site http://www.athenasc.com/convexity.html
Author: Klaus Schittkowski
Publisher: Springer Science & Business Media
Published: 2013-06-29
Total Pages: 455
ISBN-13: 3642824501
DOWNLOAD EBOOKThis book contains the written versions of main lectures presented at the Advanced Study Institute (ASI) on Computational Mathematical Programming, which was held in Bad Windsheim, Germany F. R., from July 23 to August 2, 1984, under the sponsorship of NATO. The ASI was organized by the Committee on Algorithms (COAL) of the Mathematical Programming Society. Co-directors were Karla Hoffmann (National Bureau of Standards, Washington, U.S.A.) and Jan Teigen (Rabobank Nederland, Zeist, The Netherlands). Ninety participants coming from about 20 different countries attended the ASI and contributed their efforts to achieve a highly interesting and stimulating meeting. Since 1947 when the first linear programming technique was developed, the importance of optimization models and their mathematical solution methods has steadily increased, and now plays a leading role in applied research areas. The basic idea of optimization theory is to minimize (or maximize) a function of several variables subject to certain restrictions. This general mathematical concept covers a broad class of possible practical applications arising in mechanical, electrical, or chemical engineering, physics, economics, medicine, biology, etc. There are both industrial applications (e.g. design of mechanical structures, production plans) and applications in the natural, engineering, and social sciences (e.g. chemical equilibrium problems, christollography problems).
Author: Dimitri Bertsekas
Publisher: Athena Scientific
Published: 2015-02-01
Total Pages: 576
ISBN-13: 1886529280
DOWNLOAD EBOOKThis book provides a comprehensive and accessible presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of visualization where possible. This is facilitated by the extensive use of analytical and algorithmic concepts of duality, which by nature lend themselves to geometrical interpretation. The book places particular emphasis on modern developments, and their widespread applications in fields such as large-scale resource allocation problems, signal processing, and machine learning. The book is aimed at students, researchers, and practitioners, roughly at the first year graduate level. It is similar in style to the author's 2009"Convex Optimization Theory" book, but can be read independently. The latter book focuses on convexity theory and optimization duality, while the present book focuses on algorithmic issues. The two books share notation, and together cover the entire finite-dimensional convex optimization methodology. To facilitate readability, the statements of definitions and results of the "theory book" are reproduced without proofs in Appendix B.