Titlebook: Nondifferential and Variational Techniques in Optimization; D. C. Sorensen,R. J.- B. Wets Book 1982Latest edition Springer-Verlag Berlin H

Ejaculation

书目名称Nondifferential and Variational Techniques in Optimization影响因子(影响力)




书目名称Nondifferential and Variational Techniques in Optimization影响因子(影响力)学科排名




书目名称Nondifferential and Variational Techniques in Optimization网络公开度




书目名称Nondifferential and Variational Techniques in Optimization网络公开度学科排名




书目名称Nondifferential and Variational Techniques in Optimization被引频次




书目名称Nondifferential and Variational Techniques in Optimization被引频次学科排名




书目名称Nondifferential and Variational Techniques in Optimization年度引用




书目名称Nondifferential and Variational Techniques in Optimization年度引用学科排名




书目名称Nondifferential and Variational Techniques in Optimization读者反馈




书目名称Nondifferential and Variational Techniques in Optimization读者反馈学科排名

沙文主义

Optimality conditions for piecewise smooth functions,y and sufficient conditions are established for this class of nonsmooth functions. However when a piecewise smooth function cannot be expressed as the maximum of its component functions there are severe limitations in the usual first order necessary conditions, and simple examples are given to illus

生命层

EXALT

A model algorithm for composite nondifferentiable optimization problems,enalty functions in nonlinear programming, nonlinear min-max problems, best nonlinear . ., . . and . . approximation and finding feasible points of nonlinear inequalities. The idea is used of making a linear approximation to . whilst including second order terms in a quadratic approximation to .. Th

有斑点

A problem in capillarity and plasticity,from characteristic functions, and we compute the minimum value—which represents the critical contact angle in capillarity and the collapse factor in plasticity. The analysis is a continuous analogue of the max flow-min cut theorem, and a future publication of the first author will extend that theor

Kernel

解决

Eclampsia

反对

Cosmopolitan

On the convergence of a block successive over-relaxation method for a class of linear complementariw feature of the method is that it contains certain reduction operations at each iteration. Such reductions are needed in order to ensure the boundedness (and therefore the existence of accumulation points) of the sequence of iterates produced by the algorithm. Convergence of the method is established by using a theorem due to Zangwill.