44 国际基础科学大会-Applications of additive combinatorics to problems in fractal geometry 59:01 国际基础科学大会-Defects in Quantum Field Theory and Applications-Zohar Komargodski 50:48 国际基础科学大会-On Langlands duality for the affine Hecke category-Roman Bezrukavnikov 51:10 国际基础科学大会-...
44 国际基础科学大会-Applications of additive combinatorics to problems in fractal geometry 59:01 国际基础科学大会-Defects in Quantum Field Theory and Applications-Zohar Komargodski 50:48 国际基础科学大会-On Langlands duality for the affine Hecke category-Roman Bezrukavnikov 51:10 国际基础科学大会-...
We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. We use these results in order to write optimality conditions for a special kind of solutions for set optimization problems.D...
Optimization problems with discrete variables are known as combinatorial optimization problems. If the variables in the problem are continuous, we can use calculus to solve the problem. A continuous optimization problem can be defined using the following standard form as an objective function (the ...
For a class of infinite-dimensional minimization problems with nonlinear equality constraints, an iterative algorithm for finding global solutions is suggested. A key assumption is the convexity of the "epigraph", a set in the product of the image spaces of the constraint and objective functions. ...
Fractional calculus, a reasonable continuation of classical calculus, influences theories of partial differential and integral equations, approximations, signal processing, and optimizations. Attempts to generalize differential operators have implicated various properties and helpful propositions concerning machine le...
We refer the reader to any introductory calculus textbook for details and mathematical proofs. We are given a function y = f (x1,…, xn) on a subset S of the n–dimensional space ℝn. We wish to find the maximum and/or minimum values of f on the set S. There is a theorem ...
analysts who must find the best way to accomplish particular objectives, usually with the added complication of constraints on the available choices. Award-winning educator Ronald E. Miller provides detailed coverage of both classical, calculus-based approaches and newer, computer-based iterative methods...
There are many calculus-based deterministic techniques available; however, some difficult problems, especially in the areas of machine learning and artificial intelligence, can’t be solved easily using classical optimization techniques. In such situations, alternatives such as amoeba method optim...
Optimization—Theory and Applications: Problems with Ordinary Differential Equations This book has grown out of lectures and courses in calculus of variations and optimization taught for many years at the University of Michigan to graduate students at various stages of their careers, and always to a ...