作者: nepotism 時(shí)間: 2025-3-21 22:06
Elements of Convex Analysis. Linear Theorems of the Alternative. Tangent Cones, convex sets and convex cones. Convex functions and generalized convex functions will be discussed in the next chapter. Geometrically, a set . is .if the line segment joining any two points in the set lies entirely in the set. We recall that the (closed) line segment joining the points . and . of .,作者: LIMN 時(shí)間: 2025-3-22 04:14
Sensitivity Analysis,lems. In many applications, the objective function .,? as well as the constraints . . and . . may depend also on certain number of parameters. For some of these applications the optimal solution . of the unperturbed problem (i.e. with fixed values of the parameters) may be of less interest than its 作者: aggrieve 時(shí)間: 2025-3-22 08:17
Convex Optimization: Saddle Points Characterization and Introduction to Duality, variations or optimal control) where the functions involved are not differentiable (in the sense of Fré chet), but satisfy weaker assumptions concerning various kinds of limits in various kinds of differential quotients, in order to obtain generalized gradients or generalized directional derivative作者: 口訣法 時(shí)間: 2025-3-22 12:00
Linear Programming and Quadratic Programming,fine) constraints. Usually, the variables are also required to be nonnegative. As L. P. is a particular case of nonlinear programming (the involved functions are both convex and concave and differentiable on .), all theorems seen for the general case of nonlinear programming hold also for L. P. and 作者: infantile 時(shí)間: 2025-3-22 13:50
Introduction to Nonsmooth Optimization Problems,zation of saddle points of the Lagrangian function, in Chap. .) that the functions involved in the said problems are differentiable or continuously differentiable or twice-continuously differentiable. Starting from the 70s of the last century, the necessity of studying nonsmooth (i.e. nondifferentia作者: 表兩個(gè) 時(shí)間: 2025-3-22 20:31 作者: MELON 時(shí)間: 2025-3-23 00:54 作者: 易受騙 時(shí)間: 2025-3-23 03:34 作者: Agility 時(shí)間: 2025-3-23 08:18
https://doi.org/10.1007/978-1-4614-4499-2In the present chapter, we are concerned with constrained optimization problems with inequality constraints, i.e. with problem ..作者: 情感脆弱 時(shí)間: 2025-3-23 09:58 作者: 心胸開闊 時(shí)間: 2025-3-23 17:01 作者: constellation 時(shí)間: 2025-3-23 19:44
Unconstrained Optimization Problems. Set-Constrained Optimization Problems. Classical Constrained OIn this section we shall treat problem . i.e. .where . and . is an .set (for example, .) or, more generally, where for the optimal point . it holds . In other words, we assume that the optimal points of . are .to .. A first basic result is given by the following necessary optimality conditions.作者: 最初 時(shí)間: 2025-3-23 23:02
Constrained Optimization Problems with Inequality Constraints,In the present chapter, we are concerned with constrained optimization problems with inequality constraints, i.e. with problem ..作者: 不近人情 時(shí)間: 2025-3-24 03:17
Constrained Optimization Problems with Mixed Constraints,In this chapter, we shall be concerned with problem . i.e. with a constrained minimization problem with mixed constraints, i.e. with both inequality and equality constraints.作者: Obsessed 時(shí)間: 2025-3-24 07:13 作者: BYRE 時(shí)間: 2025-3-24 12:42 作者: Manifest 時(shí)間: 2025-3-24 16:15 作者: 甜得發(fā)膩 時(shí)間: 2025-3-24 23:05 作者: 噴出 時(shí)間: 2025-3-25 00:08 作者: 苦澀 時(shí)間: 2025-3-25 04:01 作者: 古文字學(xué) 時(shí)間: 2025-3-25 09:18
E. Nelis,P. De Jonghe,V. Timmerman convex sets and convex cones. Convex functions and generalized convex functions will be discussed in the next chapter. Geometrically, a set . is .if the line segment joining any two points in the set lies entirely in the set. We recall that the (closed) line segment joining the points . and . of ., denoted as ..作者: 籠子 時(shí)間: 2025-3-25 15:15 作者: 準(zhǔn)則 時(shí)間: 2025-3-25 19:08 作者: 我們的面粉 時(shí)間: 2025-3-25 23:10
Animal models of hereditary neuropathies,les, where the variables are free to move over the whole domain of the function or (more usually) are constrained by a system of constraints. .called also .can be viewed as that field of . which treats .and .optimization problems. It seems that the term “mathematical programming” was first introduce作者: Uncultured 時(shí)間: 2025-3-26 02:11 作者: ingestion 時(shí)間: 2025-3-26 06:38 作者: constellation 時(shí)間: 2025-3-26 12:00 作者: Chronological 時(shí)間: 2025-3-26 14:41
Geneviève Morrow,Robert M. Tanguayfine) constraints. Usually, the variables are also required to be nonnegative. As L. P. is a particular case of nonlinear programming (the involved functions are both convex and concave and differentiable on .), all theorems seen for the general case of nonlinear programming hold also for L. P. and 作者: 懦夫 時(shí)間: 2025-3-26 17:23
Liver Cancer in Tyrosinemia Type 1zation of saddle points of the Lagrangian function, in Chap. .) that the functions involved in the said problems are differentiable or continuously differentiable or twice-continuously differentiable. Starting from the 70s of the last century, the necessity of studying nonsmooth (i.e. nondifferentia作者: Foment 時(shí)間: 2025-3-26 21:18
https://doi.org/10.1007/978-1-4612-5134-7iterion. However, in areas such as Economics, Social Sciences, Engineering, or Industry it is usually necessary to consider multiple objectives, confronted each other, that requires the use of decision techniques based on a finite number of objectives or criteria (multiobjective optimization or mult作者: cogent 時(shí)間: 2025-3-27 05:05
Giorgio Giorgi,Bienvenido Jiménez,Vicente NovoPuts forth a modern approach to the most valuable mathematical tools within mathematical programming theory.Forms the basis for further study of various algorithmic methods and applications of mathema作者: 弄皺 時(shí)間: 2025-3-27 06:14 作者: 啪心兒跳動(dòng) 時(shí)間: 2025-3-27 11:23
0884-8289 rential calculus for functions of several variables, the basic notions of topology and of linear algebra, and the basic mathematical notions and theoretical background used in analyzing optimization problems. T978-3-031-30326-5978-3-031-30324-1Series ISSN 0884-8289 Series E-ISSN 2214-7934 作者: constitute 時(shí)間: 2025-3-27 17:33
Textbook 2023f the various topics is largely self-contained. Prerequisites are the basic tools of differential calculus for functions of several variables, the basic notions of topology and of linear algebra, and the basic mathematical notions and theoretical background used in analyzing optimization problems. T作者: Default 時(shí)間: 2025-3-27 20:10 作者: Monolithic 時(shí)間: 2025-3-27 23:28 作者: 消息靈通 時(shí)間: 2025-3-28 04:01
Introduction to Multiobjective Optimization,, the interested reader can consult the monographs by Ehrgott [.], Miettinen [.] and Sawaragi, Nakayama and Tanino [.] in finite-dimensional spaces, and Jahn [.] and Luc [.] in infinite-dimensional spaces.作者: Ruptured-Disk 時(shí)間: 2025-3-28 09:28
0884-8289 y of various algorithmic methods and applications of mathemaThe subject of (static) optimization, also called mathematical programming, is one of the most important and widespread branches of modern mathematics, serving as a cornerstone of such scientific subjects as economic analysis, operations re作者: 無力更進(jìn) 時(shí)間: 2025-3-28 12:31
Yves Giguère,Marie-Thérèse Berthiere of these applications the optimal solution . of the unperturbed problem (i.e. with fixed values of the parameters) may be of less interest than its sensitivity with respect to changes in the parameters. In other words, one may ask: how does the solution of the problem change as a function of the changes in the values of the parameters?作者: Flavouring 時(shí)間: 2025-3-28 15:19 作者: 新鮮 時(shí)間: 2025-3-28 20:52 作者: 相互影響 時(shí)間: 2025-3-29 02:12
Introduction to Nonsmooth Optimization Problems,fferentiable or twice-continuously differentiable. Starting from the 70s of the last century, the necessity of studying nonsmooth (i.e. nondifferentiable) functions and hence nonsmooth optimization problems, gave rise to a new mathematical theory, called Nonsmooth Analysis? (this term was introduced by the Canadian mathematician F. H. Clarke).作者: 截?cái)?nbsp; 時(shí)間: 2025-3-29 03:37
Animal models of hereditary neuropathies,d by the American economist Robert Dorfman in 1949, as a generalization of the term “l(fā)inear programming”, introduced by the American mathematician George B. Dantzig a couple of years before. The term “nonlinear programming” appears for the first time in 1951 in the title of the famous pioneering paper of Kuhn and Tucker [.].作者: 流逝 時(shí)間: 2025-3-29 10:51
Basic Notions and Definitions,d by the American economist Robert Dorfman in 1949, as a generalization of the term “l(fā)inear programming”, introduced by the American mathematician George B. Dantzig a couple of years before. The term “nonlinear programming” appears for the first time in 1951 in the title of the famous pioneering paper of Kuhn and Tucker [.].作者: ULCER 時(shí)間: 2025-3-29 11:40
10樓作者: Lumbar-Stenosis 時(shí)間: 2025-3-29 18:42
10樓作者: 小蟲 時(shí)間: 2025-3-29 21:17
10樓作者: 金盤是高原 時(shí)間: 2025-3-30 00:26
10樓
