ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (61)
  • nonlinear programming  (58)
  • Ecology
  • crystal structure
  • 1980-1984  (18)
  • 1975-1979  (43)
  • Mathematics  (60)
  • Geosciences  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics & optimization 6 (1980), S. 335-360 
    ISSN: 1432-0606
    Keywords: nonlinear programming ; multiplier methods ; penalty methods ; global convergence ; penalty limitation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with penalty function and multiplier methods for the solution of constrained nonconvex nonlinear programming problems. Starting from an idea introduced several years ago by Polak, we develop a class of implementable methods which, under suitable assumptions, produce a sequence of points converging to a strong local minimum for the problem, regardless of the location of the initial guess. In addition, for sequential minimization type multiplier methods, we make use of a rate of convergence result due to Bertsekas and Polyak, to develop a test for limiting the growth of the penalty parameter and thereby prevent ill-conditioning in the resulting sequence of unconstrained optimization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 12 (1981), S. 343-354 
    ISSN: 1432-1416
    Keywords: Ecology ; Periodic differential equations ; Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Summary The theory developed here applies to populations whose size x obeys a differential equation, $$\dot x = r(t)xF(x,t)$$ in which r and F are both periodic in t with period p. It is assumed that the function r, which measures a population's intrinsic rate of growth or intrinsic rate of adjustment to environmental change, is measurable and bounded with a positive lower bound. It is further assumed that the function F, which is determined by the density-dependent environmental influences on growth, is such that there is a closed interval J, with a positive lower bound, in which there lies, for each t, a number K(t) for which $$F(K(t),t) = 0$$ and, as functions on J × ℝ, F is continuous, while ∂F/∂x is continuous, negative, and bounded. Because x(t) = 0, 〉 0, or 〈 0 in accord with whether K(t) = x(t), K(t) 〉 x(t), or K(t) 〈 x(t), the number K(t) is called the “carrying capacity of the environment at time t”. The assumptions about F imply that the number K(t) is unique for each t, depends continuously and periodically on t with period P, and hence attains its extrema, K min and K max. It is, moreover, easily shown that the differential equation for x has precisely one solution x * which has its values in J and is bounded for all t in ℝ; this solution is of period p, is asymptotically stable with all of J in its domain of attraction, and is such that its minimum and maximum values, x min * and x max * , obey $$K_{min} \leqslant x_{min}^* \leqslant x_{max}^* \leqslant K_{max}^* .$$ The following question is discussed: If the function F is given, and the function r can be chosen, which choices of r come close to maximizing, x min * ? The results obtained yield a procedure for constructing, for each F and each ɛ 〉 0, a function r such that x min * 〉 K max − ɛ.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 18 (1983), S. 255-280 
    ISSN: 1432-1416
    Keywords: Population dyamics ; Ecology ; Periodic solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract A model of the competition of n species for a single essential periodically fluctuating nutrient is considered. Instead of the familiar Michaelis-Menten kinetics for nutrient uptake, we assume only that the uptake rate functions are positive, increasing and bounded above. Sufficient conditions for extinction are given. The existence of a nutrient threshold under which the Principle of Competitive Exclusion holds, is proven. For two species systems the following very general result is proven: All solutions of a τ-periodic, dissipative, competitive system are either τ-periodic or approach a τ-periodic solution. A complete description of the geometry of the Poincaré operator of the two species system is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 7 (1979), S. 281-301 
    ISSN: 1432-1416
    Keywords: Ecology ; Population dynamics ; Semelparous species
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Summary The theory discussed in the first two papers, I and II, of this series is here generalized so that it is applicable to a population which obeys, at each instant t, the following two assumptions: (i) the rate- Dx(a, t) at which the population loses individuals of age a through death and dispersal is given by a function γt of a and the number x(a, t) of individuals which have age a, i.e.-Dx(a, t)=γt(x(a, t), a) and (ii) the number x(0, t) of newly born individuals is given by a function Ft of the number x(af, t) of individuals at a specified age af of fecundity, i.e. x(0, t)=Ft(x(af, t)). The ‘autonomous case’ in which the functions γt and Ft are independent of the subscript t corresponds to the theory developed in I and II. The present article contains a treatment of the case in which the population is in a ‘periodic environment’ in the sense that the mapping t ↦ (γt, Ft) is periodic with a period which is an integral multiple N of af. Under the assumption that for each pair (t, a) the function γt(·, a) is convex and the function Ft(·) is strictly increasing and concave, it is shown that when the environment is periodic, a given population can be expected to belong to one of three classes, regardless of initial conditions: (A) the class of ‘endangered populations’ for which the abundance function x eventually decays to zero, (B) the class of ‘asymptotically periodic populations’ for which as time increases x approaches a non-zero function x* which is periodic in time with period Naf, and (C) the class of populations which exhibit unbounded growth. The properties of the loss functions γt and fecundity functions Ft which determine the class to which a population belongs are found and discussed, and formulae are given for the stable periodic abundance function x* of a population in class B. In a discussion of the domain of application of the theory, it is pointed out that when reproduction is seasonal and is followed by mortality, the assumption that an individual interacts only with others of the same age is a reasonable one.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Geotechnical and geological engineering 2 (1984), S. 245-252 
    ISSN: 1573-1529
    Keywords: Mine ventilation ; ventilation networks ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences
    Notes: Summary Solving ventilation networks of natural air splitting is a classical problem in mine ventilation. A common approach to this problem is to formulate it based on Kirchhoff's voltage and current laws and obtain the solution by an iterative technique known as the Hardy Cross method. In this paper, it is shown that the problem can be formulated and analysed as an unconstrained optimization (minimization) problem. The computational experience with the method of conjugate gradients is also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 15 (1975), S. 667-684 
    ISSN: 1573-2878
    Keywords: Necessary conditions ; mathematical programming ; Banach spaces ; optimization theorems ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, necessary optimality conditions for nonlinear programs in Banach spaces and constraint qualifications for their applicability are considered. A new optimality condition is introduced, and a constraint qualification ensuring the validity of this condition is given. When the domain space is a reflexive space, it is shown that the qualification is the weakest possible. If a certain convexity assumption is made, then this optimality condition is shown to reduce to the well-known extension of the Kuhn-Tucker conditions to Banach spaces. In this case, the constraint qualification is weaker than those previously given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 481-491 
    ISSN: 1573-2878
    Keywords: Parameter optimization ; suboptimal control ; trajectory optimization ; Newton-Raphson methods ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The optimal control problem is reduced to a suboptimal control problem by assuming the control histories to have particular functional forms involving a number of undetermined constants (Raleigh-Ritz method). A second-order parameter optimization method is discussed and applied to the suboptimal control problem. Also, it is shown that this approach can be used to obtain approximate Lagrange multiplier distributions for optimal control problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 1-12 
    ISSN: 1573-2878
    Keywords: Methods of multipliers ; nonlinear programming ; numerical methods ; optimization theorems ; quadratically convergent algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In a recent paper (Ref. 1), the author briefly mentioned a variant of Hestenes' method of multipliers which would converge quadratically. This note examines that method in detail and provides some examples. In the quadratic-linear case, this algorithm converges in one iteration.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 297-313 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; inequality constraints ; numerical methods ; descent methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with first-order methods of feasible directions. Pironneau and Polak have recently proved theorems which show that three of these methods have a linear rate of convergence for certain convex problems in which the objective functions have positive definite Hessians near the solutions. In the present note, it is shown that these theorems on rate of convergence can be extended to larger classes of problems. These larger classes are determined in part by certain second-order sufficiency conditions, and they include many nonconvex problems. The arguments used here are based on the finite-dimensional version of Hestenes' indirect sufficiency method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 21 (1977), S. 137-174 
    ISSN: 1573-2878
    Keywords: Augmented penalty function ; method of multipliers ; penalty function methods ; nonlinear programming ; mathematical programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes an accelerated multiplier method for solving the general nonlinear programming problem. The algorithm poses a sequence of unconstrained optimization problems. The unconstrained problems are solved using a rank-one recursive algorithm described in an earlier paper. Multiplier estimates are obtained by minimizing the error in the Kuhn-Tucker conditions using a quadratic programming algorithm. The convergence of the sequence of unconstrained problems is accelerated by using a Newton-Raphson extrapolation process. The numerical effectiveness of the algorithm is demonstrated on a relatively large set of test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...