Author: Danny C. Sorensen
Publisher: North Holland
ISBN:
Category : Mathematics
Languages : en
Pages : 180
Book Description
Nondifferential and Variational Techniques in Optimization
Author: Danny C. Sorensen
Publisher: North Holland
ISBN:
Category : Mathematics
Languages : en
Pages : 180
Book Description
Publisher: North Holland
ISBN:
Category : Mathematics
Languages : en
Pages : 180
Book Description
Nondifferential and Variational Techniques in Optimization
Author: Danny C. Sorensen
Publisher: Springer
ISBN: 9783642008146
Category : Mathematics
Languages : en
Pages : 160
Book Description
Publisher: Springer
ISBN: 9783642008146
Category : Mathematics
Languages : en
Pages : 160
Book Description
Nondifferential and variational Techniques in optimization
Nondifferential and Variational Techniques in Optimization. Proceedings of the Workshop on Numerical Techniques for Systems Engineering Problems, Lexington,Ky. 1980. Ed. by D.C.Sorensen and R.J.-B.Wets. Part 2
Author: D.C. Sorensen
Publisher:
ISBN: 9789903210792
Category :
Languages : en
Pages : 159
Book Description
Publisher:
ISBN: 9789903210792
Category :
Languages : en
Pages : 159
Book Description
Practical Methods of Optimization
Author: R. Fletcher
Publisher: John Wiley & Sons
ISBN: 111872318X
Category : Mathematics
Languages : en
Pages : 470
Book Description
Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the heuristics useful in making them perform more reliably and efficiently. To this end, it presents comparative numerical studies to give readers a feel for possibile applications and to illustrate the problems in assessing evidence. Also provides theoretical background which provides insights into how methods are derived. This edition offers revised coverage of basic theory and standard techniques, with updated discussions of line search methods, Newton and quasi-Newton methods, and conjugate direction methods, as well as a comprehensive treatment of restricted step or trust region methods not commonly found in the literature. Also includes recent developments in hybrid methods for nonlinear least squares; an extended discussion of linear programming, with new methods for stable updating of LU factors; and a completely new section on network programming. Chapters include computer subroutines, worked examples, and study questions.
Publisher: John Wiley & Sons
ISBN: 111872318X
Category : Mathematics
Languages : en
Pages : 470
Book Description
Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the heuristics useful in making them perform more reliably and efficiently. To this end, it presents comparative numerical studies to give readers a feel for possibile applications and to illustrate the problems in assessing evidence. Also provides theoretical background which provides insights into how methods are derived. This edition offers revised coverage of basic theory and standard techniques, with updated discussions of line search methods, Newton and quasi-Newton methods, and conjugate direction methods, as well as a comprehensive treatment of restricted step or trust region methods not commonly found in the literature. Also includes recent developments in hybrid methods for nonlinear least squares; an extended discussion of linear programming, with new methods for stable updating of LU factors; and a completely new section on network programming. Chapters include computer subroutines, worked examples, and study questions.
Methods of Descent for Nondifferentiable Optimization
Author: Krzysztof C. Kiwiel
Publisher: Springer
ISBN: 3540395091
Category : Science
Languages : en
Pages : 369
Book Description
Publisher: Springer
ISBN: 3540395091
Category : Science
Languages : en
Pages : 369
Book Description
Mathematical Optimization Theory and Operations Research: Recent Trends
Author: Alexander Strekalovsky
Publisher: Springer Nature
ISBN: 3030864332
Category : Mathematics
Languages : en
Pages : 515
Book Description
This book constitutes refereed proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021. Due to the COVID-19 pandemic the conference was held online. The 31 full papers and 3 short papers presented in this volume were carefully reviewed and selected from a total of 102 submissions. The papers in the volume are organised according to the following topical headings: continuous optimization; integer programming and combinatorial optimization; operational research applications; optimal control.
Publisher: Springer Nature
ISBN: 3030864332
Category : Mathematics
Languages : en
Pages : 515
Book Description
This book constitutes refereed proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021. Due to the COVID-19 pandemic the conference was held online. The 31 full papers and 3 short papers presented in this volume were carefully reviewed and selected from a total of 102 submissions. The papers in the volume are organised according to the following topical headings: continuous optimization; integer programming and combinatorial optimization; operational research applications; optimal control.
Minimization Methods for Non-Differentiable Functions
Author: N.Z. Shor
Publisher: Springer Science & Business Media
ISBN: 3642821189
Category : Science
Languages : en
Pages : 171
Book Description
In recent years much attention has been given to the development of auto matic systems of planning, design and control in various branches of the national economy. Quality of decisions is an issue which has come to the forefront, increasing the significance of optimization algorithms in math ematical software packages for al,ltomatic systems of various levels and pur poses. Methods for minimizing functions with discontinuous gradients are gaining in importance and the ~xperts in the computational methods of mathematical programming tend to agree that progress in the development of algorithms for minimizing nonsmooth functions is the key to the con struction of efficient techniques for solving large scale problems. This monograph summarizes to a certain extent fifteen years of the author's work on developing generalized gradient methods for nonsmooth minimization. This work started in the department of economic cybernetics of the Institute of Cybernetics of the Ukrainian Academy of Sciences under the supervision of V.S. Mikhalevich, a member of the Ukrainian Academy of Sciences, in connection with the need for solutions to important, practical problems of optimal planning and design. In Chap. I we describe basic classes of nonsmooth functions that are dif ferentiable almost everywhere, and analyze various ways of defining generalized gradient sets. In Chap. 2 we study in detail various versions of the su bgradient method, show their relation to the methods of Fejer-type approximations and briefly present the fundamentals of e-subgradient methods.
Publisher: Springer Science & Business Media
ISBN: 3642821189
Category : Science
Languages : en
Pages : 171
Book Description
In recent years much attention has been given to the development of auto matic systems of planning, design and control in various branches of the national economy. Quality of decisions is an issue which has come to the forefront, increasing the significance of optimization algorithms in math ematical software packages for al,ltomatic systems of various levels and pur poses. Methods for minimizing functions with discontinuous gradients are gaining in importance and the ~xperts in the computational methods of mathematical programming tend to agree that progress in the development of algorithms for minimizing nonsmooth functions is the key to the con struction of efficient techniques for solving large scale problems. This monograph summarizes to a certain extent fifteen years of the author's work on developing generalized gradient methods for nonsmooth minimization. This work started in the department of economic cybernetics of the Institute of Cybernetics of the Ukrainian Academy of Sciences under the supervision of V.S. Mikhalevich, a member of the Ukrainian Academy of Sciences, in connection with the need for solutions to important, practical problems of optimal planning and design. In Chap. I we describe basic classes of nonsmooth functions that are dif ferentiable almost everywhere, and analyze various ways of defining generalized gradient sets. In Chap. 2 we study in detail various versions of the su bgradient method, show their relation to the methods of Fejer-type approximations and briefly present the fundamentals of e-subgradient methods.
Convex Analysis and Minimization Algorithms I
Author: Jean-Baptiste Hiriart-Urruty
Publisher: Springer Science & Business Media
ISBN: 3540568506
Category : Mathematics
Languages : en
Pages : 442
Book Description
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.
Publisher: Springer Science & Business Media
ISBN: 3540568506
Category : Mathematics
Languages : en
Pages : 442
Book Description
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.
Nondifferentiable Optimization and Polynomial Problems
Author: N.Z. Shor
Publisher: Springer Science & Business Media
ISBN: 1475760159
Category : Mathematics
Languages : en
Pages : 407
Book Description
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) ~ 0 is equivalent to P(:e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ... ,a } be integer vector with nonnegative entries {a;}f=l. n Denote by R[a](:e) monomial in n variables of the form: n R[a](:e) = IT :ef'; ;=1 d(a) = 2:7=1 ai is the total degree of monomial R[a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P.
Publisher: Springer Science & Business Media
ISBN: 1475760159
Category : Mathematics
Languages : en
Pages : 407
Book Description
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) ~ 0 is equivalent to P(:e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ... ,a } be integer vector with nonnegative entries {a;}f=l. n Denote by R[a](:e) monomial in n variables of the form: n R[a](:e) = IT :ef'; ;=1 d(a) = 2:7=1 ai is the total degree of monomial R[a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P.