# minimize

(redirected from minimizers)
Also found in: Dictionary, Thesaurus, Legal.

## minimize

[′min·ə‚mīz]
(communications)
Condition when normal message and telephone traffic is drastically reduced so messages connected with an actual or simulated emergency will not be delayed.
(computer science)
In a graphical user interface environment, to reduce a window to an icon that represents the application running in the window.

## minimize

A feature of a graphics-based operating system that hides the application currently on screen. To show the app is still open, an icon representing the program is placed on the Taskbar in Windows or the Dock in the Mac. Clicking the Taskbar or Dock icon restores the application to its previous size and location on screen. Contrast with maximize. See Win Minimize windows.

Minimize Buttons The underscore button (_) is the minimize button in Windows and Mac. Clicking it sends the application to the sidelines.
References in periodicals archive ?
We use spectral projected gradient (SPG) method to seek for the minimizers of the constraint functional and prove the convergence.
In Section 4, the spectral projected gradient method is applied to compute the minimizers. Section 5 provides a detailed exposition of multiparameter choice rule based on the balancing principle.
To mitigate the effect of these words, the speaker should use some minimizers. For instance (Leprocy and cancer, ....
Expression of admiration is accompanied by minimizers which causes protection from bad or evil eyes.
Let X be a set of all minimizers of the objective function (15) and [A.sub.[phi]] = ([a.sup.1.sub.[phi]], ..., [a.sup.m.sub.[phi]]) be the set of angular coordinates of the existingfacilities (demand points).
Thus, if [Q.sub.+] = 0 then [x*.sub.[phi]] is not a minimizer of the objective function (15) unless all values [a.sup.i.sub.[phi]] are its minimizers.
The problem whether such functionals yield regularizations of the underlying inverse problem (i.e., whether minimizers of (1.3) converge to a solution of (1.1) as [alpha], [delta] [right arrow] 0) has been analyzed intensively for linear and nonlinear settings over the last years; see, e.g., [12, 20, 24, 32, 37].
Furthermore, the sequence of minimizers [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] should converge to a minimizer of problem (3.1).
The result is an apparently robust method for approximating what are usually difficult minimizers to locate.
By definition, time minimizers will have higher reproductive success if they arrive early in the window, and energy maximizers will have higher reproduction if they arrive with extra energy reserves.
The paper [45] provides classical results on the existence of minimizers, stability, and convergence for the particular approach considered here using Tikhonov regularization.
One hope is that the minimizers for Tikhonov regularization with penalty term [[PSI].sub.p[beta]][(x).sup.p] are not that far away from the minimizers of Tikhonov regularization with penalty [[PSI].sub.p[beta]](x) and that they have similar sparsity patterns.

Site: Follow: Share:
Open / Close