A Demonstration of the Procedure minimize

はじめる前に
新機能一覧
Maple ワークシートの作成
Mapleワークシートを共有
Maple ウィンドウのカスタマイズ
Maple システムのカスタマイズ
コネクティビティ
Mathematics
数学
- テンソル解析
- パッケージ
- ファンクションアドバイザ
- ベキ級数
- ベクトル解析
- 不活性関数
- 代数
- 因数分解と方程式解法
- 基本数学
- 基本的な注意事項
- 変分法
- 変換
- 幾何
- 微分代数方程式
- 微分幾何学
- 微分方程式
- 微積分
- 数
- 数値計算
- 数学関数
- 数論
- 最適化
  - シンプレックス法による線形最適化
  - 最適化（Optimization）パッケージ
  - exterma
  - hermite pade コマンド
  - maxnorm コマンド
  - min コマンド
  - MinimalPolynomial コマンド
  - minimax コマンド
  - 最小化
  - 最小化の例
- 特殊関数
- 統計
- 線形代数
- 群論
- 評価
- 論理
- 過去のパッケージ
- 金融
- 離散数学
- piecewise examples
- グラフ電卓
- 区分関数
物理
プログラミング
グラフィックス
Student パッケージ
Science and Engineering
科学・エンジニアリング
アプリケーションと例題
リファレンス
システム
MapleSim
MapleSim ツールボックス
MapleSim ヘルプ
Tasks
Toolboxes
エラーメッセージガイド
マニュアル
数学アプリ

The procedure minimize returns the infimum of an expression or function over a given domain. It is also possible to have minimize return both the infimum and the location where the infimum is either approached or achieved.

The Infimum of a Function

A function on a given domain D is said to be bounded below on D if there exists a real number such that for each in D. If such a exists then it is called a lower bound of on . For example, the function cosh(x) is bounded below by 0, (or any other number less than or equal to 1.)

If a function is bounded below on a domain D and if there exists an alpha which is a lower bound of f on D with the additional property that for any other lower bound gamma it follows that then alpha is said to be the infimum of the function on D. For example, the infimum of the function over the real line is 1. Another example is the function on the real line which has an infimum of 0 but there does not exist a real number such that .

If a function is not bounded below then the infimum is said to be . For example, the infimum of on the interval -5..5 is :

An Example of Finding the Infimum Analytically

As an example, we will prove that the infimum of on the real line is 1.

and therefore 1 is a lower bound. Differentiating with respect to , we get

(1.1.1)

which is a function which is strictly greater than zero for and strictly less than zero for . By the mean value theorem, we have that for all . Since is continously differentiable, using the mean value theorem

(1.1.2)

	Proof Using the Mean Value Theorem
	The mean value theorem states that for two values x and y where , there exists some value c in the open interval (x,y) such that . In this case, if we assume y>0 this gives us that for some value c in the open interval (0,y). Therefore c>0 and thus and so therefore . A similar argument gives us the same result when . Therefore the infimum of is 1.

we have that for all x other than zero, and so therefore 0 is a lower bound of the function . The value 1 must also be the greatest upper bound, for if there was any upper bound such that , then and so therefore beta is not a lower bound of . Therefore, the infimum of on the real line is , as is returned by Maple:

(1.1.3)

The user may wish to try this technique with a simpler function such as .

Specifying the Domain of a Variable

The domain of a variable can be specified in one of three ways:

The Default minimize( f(x), x )

If just the variable is listed, then it is assumed that that variable is to be minimized over the entire real line, that is, .

(2.1.1)

A Range minimize( f(x), x = 0..1 )

If the variable is equated to a range, then the variable is minimized over the closed interval bounded by the given range. The endpoints of the range must be of type realcons.

(2.2.1)

This form of specifying the domain over which the function is to be minimized allows a quick substitution to give a plot of the function:

(7/8)*LambertW(4/7)^2+exp(-LambertW(4/7))

(2.2.2)

(2.2.3)

A Simple Relation minimize( f(x), x > 0 )

A domain can be specified by having a name related to an object of type realcons by one of the relation operators =, <, <=, > or >=. Some examples are:

(2.3.1)

(2.3.2)

(2.3.3)

(2.3.4)

(2.3.5)

If no domains are given for any variable then it is assumed that each indeterminate of type name is being minimized over the entire real line:

(2.1)

(2.2)

(2.3)

Option location

If the option location or location=true is given, then an expression sequence of two objects is returned, the first being the infimum and the second is a set of lists where the first operand of each list is a list of substitutions which indicates a point or set of points at or near which the infimum is either approached or achieved. Four examples are:

(3.1)

(3.2)

$0, {[{x = 2^(1/2)}, 0], [{x = -2^(1/2)}, 0]}$

(3.3)

(3.4)

In some cases, minimize cannot determine the location and therefore returns FAIL as the location.

(3.5)

The option location=false can be given to indicate explicitly that only the infimum is wanted.

If there are multiple options for the keyword location then the last is used.

(3.6)

(3.7)

The location Data Structure

A location data structure (see previous section) can be used to quickly find the value of the function or the point(s) where the infimum is achieved (assuming the function is continuous and being minimized over a closed interval.)

(4.1)

(4.2)

In some cases due to weakness in other parts of Maple, minimize will return a collection of answers if it cannot determine which is the infimum:

(4.3)

(4.4)

(4.5)

Relation of the Location of the Minimum and the Infimum

If the infimum is finite then any location returned when option location is given indicates that that the infimum is either achieved at that point or approached arbitrarily closely in any open neighborhood around the point. The location may not even be in the original interval being minimized over, but rather one of the endpoints of the interval. If the infimum is then the function is not bounded below on any open neighborhood of the point.